UVA 10474 Where is the Marble

 1 #include <bits/stdc++.h>
 2 
 3 #define N 100010
 4 #define maxn 200010
 5 
 6 using namespace std;
 7 
 8 typedef long long int ll;
 9 
10 int main()
11 {
12     vector<int> a;
13     vector<int>::iterator ite;
14     int n, i, q, num;
15     i=0;
16     while(cin>>n>>q , n||q){
17         a.clear();  //清空容器
18         while(n--){
19             cin>>num;
20             a.push_back(num);
21         }
22         sort(a.begin(), a.end());
23         int x;
24         printf("CASE# %d:\n", ++i);
25         while(q--){
26             cin>>x;
27             ite=lower_bound(a.begin(), a.end(), x);
28             if(*ite==x){
29                 printf("%d found at %d\n", x, ite-a.begin()+1);
30             }
31             else printf("%d not found\n", x);
32         }
33     }
34     return 0;
35 }