Where is the Marble? UVA - 10474

问题类型：数组，排序，搜索。

03pie’s solution for [UVA-10474]：

#include<bits/stdc++.h>//包含所有头文件
using namespace std;

#define ms(s) memset(s,0,sizeof(s))typedef unsigned long long ULL;
typedef long long LL;

const double PI = 3.141592653589;
const int INF = 0x3fffffff;

const int maxn=10000;
int main(){
//    freopen("F://inp.txt","r",stdin);

    int n,q,x,a[maxn],kase=0;
    while(scanf("%d%d",&n,&q)==2&&n){
        printf("CASE# %d:\n",++kase);
        for(int i=0;i<n;i++)    scanf("%d",&a[i]);
        sort(a,a+n);
        while(q--){
            scanf("%d",&x);
//          寻找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;
}