大理石在哪儿 （Where is the Marble?,UVa 10474)

题目描述：算法竞赛入门经典例题5-1

#include <iostream>
#include <algorithm>
using namespace std;
int maxn = 10000 ;
int main()
{
    int n,q,a[maxn] ,k=0;
    while(scanf("%d%d",&n,&q)==2 && n &&q){
        for(int i=0;i<n;i++) scanf("%d",&a[i])    ;
        printf("CASE# %d:\n",++k)    ;
        sort(a,a+n);
        while(q--){
            int x;
            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;
}