백준 1920 수 찾기

백준 1920

#include <bits/stdc++.h>
using namespace std;
int n;
int arr[100001];
int binarySearch(int target) {
	
	int left=0, right=n-1;
	while (left <= right) {
		int mid = (left + right) / 2;

		if (arr[mid] > target) {
			right = mid - 1;
		}
		else if (arr[mid] < target) {
			left = mid + 1;
		}
		else {
			return 1;
		}
	}
	return 0;
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	cin >> n;

	for (int i = 0; i < n; i++) cin >> arr[i];

	sort(arr, arr + n);

	int m;
	cin >> m;

	while (m--) {
		int x;
		cin >> x;
		//cout<< binarySearch(x) << '\n';
		cout << binary_search(arr, arr + n, x)<<'\n';
	}

}