uvaoj 10474 - Where is the Marble?(sort+lower_bound)

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1415

STL中sort和lower_bound（返回大于或者等于x的第一个位置）应用

 #include<bits/stdc++.h>
 using namespace std;
 int a[];
 int main()
 {
     int n,q,cases=;
     while(~scanf("%d %d",&n,&q),n+q)
     {
         cases++;
         printf("CASE# %d:\n",cases);
         for(int i=;i<n;i++)
         {
             scanf("%d",&a[i]);
         }
         sort(a,a+n);
         while(q--)
         {
             int temp;
             scanf("%d",&temp);
             int ans=lower_bound(a,a+n,temp)-a;
             //printf("%d\n",ans);
             if(a[ans]==temp)printf("%d found at %d\n",temp,ans+);//重点
             else printf("%d not found\n",temp);
         }
     }
     return ;
 }