Uva.10474 Where is the Marble?

题目链接：https://vjudge.net/problem/UVA-10474

代码如下：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<sstream>
#include<map>
//#define DEBUG
const int maxn = 10050;
using namespace std;;

int main() {
#ifdef DEBUG
	freopen("Text.txt", "r", stdin);
#endif // DEBUG
	cin.tie(0);
	cin.sync_with_stdio(false);
	int a[maxn], n, q;
	int flag = 1;
	while (cin >> n >> q) {
		if (n == 0 && q == 0)
			break;
		printf("CASE# %d:\n", flag++);
		
		int i;
		for (i = 0; i < n; i++)
			cin >> a[i];
		sort(a, a + n);
		while (q--) {
			int pos, num;
			cin >> num;
			pos = lower_bound(a, a + n, num) - a ;
			if (a[pos] == num)
				printf("%d found at %d\n",num,pos+1);
			else
				printf("%d not found\n", num);
		}
	}

	return 0;
}