UVa 10474 - Where is the Marble?

10474 - Where is the Marble?

思路：例题5-1

关于.lower_bound()：http://blog.csdn.net/niushuai666/article/details/6734403

#include <cstdio>]#include <cstring>#include <string>#include <iostream>#include <sstream>#include <cmath>#include <algorithm>#include <vector>#include <iomanip>#include <map>using namespace std;const int MAXN = 100000;int main(){int n, q, x, a[MAXN];int cas = 0;while (~scanf("%d%d", &n, &q) && n){printf("CASE# %d:\n", ++cas);for (int i = 0; i < n; i++)scanf("%d", &a[i]);sort(a, a + n);while (q--){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;}