uva10474

输出x在A中排第几小或输出没有x.

#include<cstdio>
#include<algorithm>
using namespace std;
int a[100000];
int main() {
	int m, n; int x; int k = 0;
	while (scanf_s("%d%d",&m,&n)==2&&m) {
		printf("CASE# %d:\n", ++k);
		for (int i = 0; i < m; i++) {
			scanf_s("%d",&a[i]);
		}
		sort(a, a + m);
		for (int i = 0; i < n; i++) {
			scanf_s("%d", &x);
			int q = lower_bound(a, a + m, x) - a;//注意这个函数的用法
			if (q < m&&a[q] == x)
				printf("%d found at %d\n", x, q+1);
			else
				printf("%d not found\n", x);
		}
	}
	return 0;
}