C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 10815번:숫자 카드 답

#include <iostream>
#include <algorithm>
using namespace std;
int n, m;
int a[500000];
int bs(int x)
{
    int r = n-1;
    int l = 0;
    while (l <= r)
    {
        int mid = (r + l) / 2;
        if (a[mid] == x)
            return 1;
        else if (a[mid] < x)
            l = mid + 1;
        else if (a[mid] > x)
            r = mid - 1;
    }
    return 0;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    sort(a,a+n);
    cin >> m;
    while (m--)
    {
        int x;
        cin >> x;
        cout << bs(x) << ' ';
    }
}