BAEKJOON 10815 - 숫자 카드

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

1920번 수 찾기 문제와 같은 문제네요.

#pragma warning (disable:4996)
#include <cstring>
#include <climits>
#include <algorithm>
 
using namespace std;
 
int binarySearch(const int* numbers, int target, int n)
{
    int low = 0;
    int high = n - 1;
 
    while (low <= high)
    {
        int mid = (low + high) / 2;
        if (numbers[mid] > target)
            high = mid - 1;
        else if (target > numbers[mid])
            low = mid + 1;
        else if (numbers[mid] == target)
            return 1;
    }
 
    return 0;
}
 
int main()
{
    int n, m, num;
    scanf("%d", &n);
    int* numbers = new int[n];
    for (int i = 0; i < n; i++)
        scanf("%d", &numbers[i]);
 
    sort(numbers, numbers + n);
    scanf("%d", &m);
    for (int i = 0; i < m; i++)
    {
        scanf("%d", &num);
        printf("%d", binarySearch(numbers, num, n));
        if (i != m - 1)
            printf(" ");
    }
    delete[] numbers;
    return 0;
}