10474 Where is The Marble.cpp

#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <limits>
#define iter(a,b,c,d) for(a = b; a < c; a+=d)
#define ited(a,b,c,d) for(a = b; a > c; a-=d)
#define li long int
#define uli unsigned li
#define ll long li
#define ull unsigned ll
#define si(a) scanf("%d",&a)
#define sli(a) scanf("%ld",&a)
#define sll(a) scanf("%lld",&a)
#define slu(a) scanf("%llu",&a)
#define sf(a) scanf("%f",&a)
#define slf(a) scanf("%lf",&a)
#define PI 3.1415926
using namespace std;
int main()
{
    /*freopen("1in.txt", "r", stdin);
    freopen("1out.txt", "w", stdout);*/
    int a,b,i,temp,casen = 1;
    int arr[10010];
    while(scanf("%d %d",&a,&b) && (a|b))
    {
        iter(i,0,a,1) si(arr[i]);
        sort(arr,arr+a);
        printf("CASE# %d:\n",casen++);
        while(b--)
        {
            si(temp);
            auto it = lower_bound(arr,arr+a,temp);
            if(*it == temp)
                printf("%d found at %d\n",temp,(it-arr)+1);
            else
                printf("%d not found\n",temp);
        }
    }
    return 0;
}