NYOJ NO.86 找球号(一）

#include<cstdio>
#include<algorithm>
using namespace std;
#define N 1000005
long long int array[N];
int search(long long int array[], long long int key, long long int leng)            //二分查找
{
    long long int mid, front = 0, end = leng;
    while(front <= end)
    {
        mid = (front+end)/2;
        if(array[mid] == key)
            return 1;
       else if(array[mid] < key)
            front = mid +1;
        else
            end = mid - 1;
    }
    return 0;
}
int main()
{
    long long int m, n, a, b, i = 0;
    scanf("%lld", &m);
    scanf("%lld", &n);
    b = m;
    while(m--)
        scanf("%lld",&array[i++]);
    sort(array, array+b);                //C++的排序函数
    while(n--)
    {
        long long int he;
        scanf("%lld",&he);
        printf("%s\n", search(array, he, b-1) ? "YES" : "NO");
    }
    return 0;
}