uva10474 Where is the Marble?

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 10000;

int main()
{
    int n, q, x, a[maxn], kase = 0;
    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);//对n个大理石进行排序
        while(q--) {//循环q个问题
            scanf("%d", &x);
            int p = lower_bound(a, a+n, x) - a;//用lower_bound()函数查找“大于或者等于x的第一个位置”
            if(a[p] == x) printf("%d found at %d\n", x, p+1);
            else printf("%d not found\n", x);
        }
    }
    return 0;
}