Uva10474-STL水题-白书

#include <algorithm>
#include <cstring>
#include <ctype.h>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>

using namespace std;

int N,M,T,kase;
int save[1000000];
int main()
{
while(~scanf("%d%d",&N,&M) && N)
{
kase++;
for(int i=0;i<N;i++)
{
scanf("%d",&save[i]);
}
sort(save,save+N);
printf("CASE# %d:\n",kase);
for(int i=0;i<M;i++)
{
scanf("%d",&T);
int p = lower_bound(save,save+N,T) - save;
if(save[p] == T)
printf("%d found at %d\n",T,p+1);
else
printf("%d not found\n",T);
}
}
}