1920번: 수 찾기

#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int n, *num, m, mnum, ans = 0;
    scanf("%d", &n);
    num = new int[n];
    for (int i = 0; i < n; ++i)
        scanf("%d", &num[i]);
    sort(num, num + n);
    for (scanf("%d", &m); m--; ans = 0)
    {
        scanf("%d", &mnum);
        int low = 0, high = n - 1, mid;
        while (low <= high)
        {
            mid = (low + high) / 2;
            if (mnum > num[mid])
                low = mid + 1;
            else if (mnum < num[mid])
                high = mid - 1;
            else
            {
                ans = 1;
                break;
            }
        }
        printf("%d\n", ans);
    }
}