UVA 10474 Where is the Marble?

主要就是用到了二分查找，我先用binary_search()，判断在数组中是否存在那个数，然后再用lower_bound()返回那个数的位置。

#include <algorithm>
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
  int n,m;
  int arr[10005];
  int cas=1;
  while(scanf("%d%d",&n,&m)&&n&&m)
  {
     for(int i=0;i<n;++i)
      cin>>arr[i];
     sort(arr,arr+n);
     int tmp;
     printf("CASE# %d:\n",cas++);
     for(int i=0;i<m;++i)
     {
        cin>>tmp;
        bool flag=binary_search(arr,arr+n,tmp);
        int pos=lower_bound(arr,arr+n,tmp)-arr;
        //cout<<pos<<endl;
        if(!flag)
        {
          printf("%d not found\n",tmp);
        }
        else
          printf("%d found at %d\n",tmp,pos+1);
     }
  }
  return 0;
}