UVA 10474 Where is the Marble?

大意：排序，求数字第一次出现的位置。

CODE:

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;

int n, m;
int a[10001];

int cmp(const void *a, const void *b)
{
    return *(int*)a - *(int*)b;
}

int main()
{
    int times = 0;
    while(~scanf("%d%d", &n, &m) && (n || m))
    {
        for(int i = 0; i < n; i++) scanf("%d", &a[i]);
        qsort(a, n, sizeof(int), cmp);
        printf("CASE# %d:\n", ++times);
        for(int i = 0; i < m; i++)
        {
            int q, flag = 0;
            scanf("%d", &q);
            for(int j = 0; j < n; j++) if(a[j] == q)
            {
                flag = 1;
                printf("%d found at %d\n", q, j+1);
                break;
            }
            if(!flag) printf("%d not found\n", q);
        }
    }
    return 0;
}