jindal.manishkumar1
BAN USERi think its not correct
test case
1 2 2 1 1
o/p is 2
it should be 1
Sort than pairwise swap elements.. (nlogn)
- jindal.manishkumar1 June 18, 2014#include<iostream>
#include<set>
using namespace std;
int main()
{
set<int>myset;
int n1,n2;
int a1[1000],a2[1000];
scanf("%d",&n1);
for(int i=0;i<n1;i++)
{
cin>>a1[i];
myset.insert(a1[i]);
}
scanf("%d",&n2);
set<int>::iterator it;
for(int i=0;i<n2;i++)
{
cin>>a2[i];
it=myset.find(a2[i]);
if(it!=myset.end())
cout<<*it;
}
return 0;
}
#include<iostream>
using namespace std;
int main()
{
int n,a[10000],ans=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
cin>>a[i];
ans=ans^a[i];
}
cout<<ans<<endl;
return 0;
}
#include<iostream>
using namespace std;
struct node
{
int a;
int b;
};
bool check(struct node s1,struct node s2)
{
return (s1.b<=s2.b);
}
int main()
{
int n;
scanf("%d",&n);
struct node p[10000];
for(int i=0;i<n;i++)
cin>>p[i].a;
for(int i=0;i<n;i++)
cin>>p[i].b;
sort(p,p+n,check);
for(int i=0;i<n;i++)
cout<<p[i].a;
return 0;
}
use map,key is array item and frequency is value.
- jindal.manishkumar1 June 18, 2014and sort it according to value