UVA10474-弹珠在哪里

#include <iostream>
#include <cstdlib>
using namespace std;
int com (const void *a,const void *b)
{
    return *(int *)a - *(int *)b;
}
int main ()
{
    int n, m, num = 0;
    while(cin>>n>>m)
    {
        if(!n&&!m)break;
        num++;
        cout<<"CASE# "<<num<<":"<<endl;
        int a[n];
        for(int i = 0; i < n; i++)
        cin>>a[i];
        qsort(a,n,sizeof(a[0]),com);
        while(m--)
        {
            int b, flag = 0;
            cin>>b;
            for(int i = 0 ; i < n; i++)
            {
                if(a[i] == b){flag = 1;cout<<b<<" found at "<<i+1<<endl;break;}
            }
            if(!flag)
            cout<<b<<" not found"<<endl;
        }

    }
    return 0;
}

此题是十足的水题，一遍A掉，算法简单，没什么收获。