[BOJ] 10815번: 숫자 카드

https://www.acmicpc.net/problem/10815

이분 탐색

#include <cstdio>
#include <algorithm>
using namespace std;

int n, m, ar[500001];

bool bs(int find)
{
    int s = 0, f = n - 1;

    while (s <= f) {
        int mid = (s + f) / 2;
        if (ar[mid] == find) return 1;
        else if (ar[mid] > find) f = mid - 1;
        else s = mid + 1;
    }
    return 0;
}

int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) scanf("%d", &ar[i]);
    sort(ar, ar + n);

    scanf("%d", &m);
    while (m--) {
        int a;
        scanf("%d", &a);
        printf("%d ", bs(a));
    }
    return 0;
}