/*c风格*/#include<cstdio.h>#include<algorithm>
using namespace std;constint manx=10000;intmain(){int n,q,x;int a[maxn];int kase=0;while(scanf("%d%d",&n,&q)==2 and n){printf("CASE# %d:\n",++kase);for(int i=0;i<n;i++)scanf("%d",&a[i]);sort(a,a+n);while(q--){scanf("%d",&x);int p=lower_bound(a,a+n,x)-a;//查找大于或者等于x的第一个位置 if(a[p]==x)printf("%d found at %d\n",x,p+1);elseprintf("%d not found\n",x);}}return0;}
#include<bits/stdc++.h>using namespace std;int main(){ int n,q; int k=0; while(cin>>n>>q){ if(n==0 and q==0) break; k++; int data[n]; for(int i=0;i<n;i++) cin>...