题目地址:https://vjudge.net/contest/387828#problem/E
分析:主要是看懂这道题,就是一个升序排序加二分查找就完事了
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=10005;
int n,q,i,j,a,s[maxn],sum=1;
int main()
{
while(~scanf("%d %d",&n,&q))
{
if(n==0&&q==0) break;
for(i=1;i<=n;i++)
{
scanf("%d",&s[i]);
}
sort(s+1,s+1+n);
printf("CASE# %d:\n",sum);
sum++;
while(q--)
{
scanf("%d",&a);
int t=lower_bound(s+1,s+1+n,a)-s;
if(s[t]==a) printf("%d found at %d\n",a,t);
else printf("%d not found\n",a);
}
}
return 0;
}