#include
#include
#include
using namespace std;
int main() {
// your code goes here
int n1,n2,n3;
cin>>n1>>n2>>n3;
int a[n1+n2+n3];
for(int i=0;i<n1+n2+n3;i++)
{
cin>>a[i];
}
int count = 0;
vector<int> arr;
sort(a, a+n1+n2+n3);
for(int i=0;i<n1+n2+n3;i++)
{
for(int j=i;j<n1+n2+n3;j++)
{
if(a[i] == a[j])
{
count++;
}
}
if(count>=2)
{
arr.push_back(a[i]);
}
count=0;
}
// for(int i=0;i<arr.size();i++)
// {
// cout<<arr[i]<<" ";
// }
vector<int>::iterator ip;
ip = std::unique(arr.begin(), arr.end());
arr.resize(std::distance(arr.begin(), ip));
for (ip = arr.begin(); ip != arr.end(); ++ip) {
cout << *ip<<endl;
}
return 0;
}
this is my solution can anyone help me to make it less time complexity