Where is the Marble? UVA - 10474 

题意：有n个大理石，每个大理石上写了一个非负整数，首先把各数从小到大排序，然后回答q个问题，每个问题问是否有一个大理石上写着某个整数x，如果是，还要回答那个大理石上写着x。

#include <iostream>
#include <cstdio>
#include <algorithm>
const int maxn = 10005;
using namespace std;

int main()
{
    int n,qnum;
    int ans = 1;
    while(scanf("%d %d",&n,&qnum) != EOF)
    {
        if(n == 0 && qnum == 0)
            break;
        printf("CASE# %d:\n",ans++);
        int a[maxn],q;
        for(int i = 1; i <= n; i ++)
            scanf("%d",&a[i]);
        sort(a,a+n+1);
        while(qnum --)
        {
            scanf("%d",&q);
            int temp = 0;
            for(int i = 1; i <= n; i ++)
            {
                if(a[i] >= q)
                {
                    temp = i;
                    break;
                }
            }
            if(a[temp] == q)
                printf("%d found at %d\n",q,temp);
            else
                printf("%d not found\n",q);
        }
    }
    return 0;
}