UVA 10474

题目大意：输入n，q，输入n个石头的分数，把石头按分数排序，输入q个分数，在所有石头里找是否存在这个分数。

解题思路：暴力两个循环。用stl里的lower_bound()用法请百度。

#include <iostream>#include <algorithm>using namespace std;int n, q, a[100005], cnt=1, b, flag;int main(){while (scanf("%d%d", &n, &q)!=EOF && n+q){for (int i=0; i<n; i++)scanf("%d", &a[i]);sort(a, a+n);printf("CASE# %d:\n", cnt++);for (int i=0; i<q; i++){scanf("%d", &b);flag = 0;for (int j=0; j<n; j++)if (a[j] == b){flag = j + 1;break;}if (flag)printf("%d found at %d\n", b, flag);elseprintf("%d not found\n", b);} }return 0; }