2016春季练习——位运算

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=1000;
int a[MAXN];
int n,m;
int shua(int k){
int cnt=0;
while(k){
if(k&1)cnt++;
k>>=1;
}
return cnt;
}
void diff(int b){
int i,j=0;
int maxn=99999999;
for(i=0;i<n;i++){
int k=shua(a[i]^b);
if(k<maxn) j=i;
maxn=min(maxn,k);
}
cout<<a[j]<<endl;
}
int main(){
int c;
cin>>c;
while(c--){
cin>>n>>m;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
while(m--){
int b;
cin>>b;
diff(b);
}
}
return 0;
}