排序加二分查找
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100000;
int n,q,mar[maxn];
int main(){
int kase = 0;
while(scanf("%d%d",&n,&q) == 2 && n){
for(int i = 0;i < n;i++) scanf("%d",&mar[i]);
sort(mar,mar + n);
printf("CASE# %d:\n",++kase);
int qnum,p;
while(q--){
scanf("%d",&qnum);
p = lower_bound(mar,mar + n,qnum) - mar;
if(mar[p] == qnum) printf("%d found at %d\n",qnum,p+1);//二分查找 不是 p == n
else printf("%d not found\n",qnum);
}
}
return 0;
}