#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 10000;
int main()
{
int n, q, x, a[maxn], kase = 0;
while(cin >> n >> q && n){
cout << "CASE# " << ++kase << ":" << endl;
for(int i = 0; i < n; i++) cin >> a[i];
sort(a, a+n);
while(q--){
cin >> x;
int p = lower_bound(a, a+n, x) - a;
if(a[p] == x) cout << x << " found at " << p+1 << endl;
else cout << x << " not found\n";
}
}
return 0;
}
lower_bound从数组中寻找x,返回找到的指针
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 10000;
int main()
{
int n, q, kase = 0, x, a[maxn];
while(scanf("%d%d",&n,&q) == 2 && n){
printf("CASE# %d:\n",++kase);
for(int i = 0; i < n; i++) scanf("%d",&a[i]);
sort(a, a+n);
for(int i = 0; i < q; i++){
scanf("%d", &x);
int p = lower_bound(a, a+n, x) - a;
if(a[p] == x) printf("%d found at %d\n",x,p+1);
else printf("%d not found\n",x);
}
}
return 0;
}