qsort bsearch的应用

# include <stdio.h>

int a[100005];

int compare1(const void *a, const void *b)
{
    int *pa = (int *)a;
    int *pb = (int *)b;
    int num1 = *pa;
    int num2 = *pb;
    return num1 - num2;
}

int compare2(const void *key, const void *e)
{
    int *pkey = (int *)key;
    int *pe = (int *)e;
    int num1 = *pkey;
    int num2 = *pe;
    return num1 - num2;
}

int main()
{
    int m, n;
    while ( ~scanf("%d %d", &m, &n) )
    {
        int i;
        for (i=0; i<m; i++)
            scanf("%d", a+i);

        qsort(a, m, sizeof(int), compare1);

        for (i=0; i<n; i++)
        {
            int key;
            scanf("%d", &key);
            if ( bsearch(&key, a, m, sizeof(int), compare2) )
                printf("YES\n");
            else
                printf("NO\n");
        }
    }
}