백준 1920 c++

#include <iostream>
#include <algorithm>

using namespace std;

int A[1000000];

void input_arr(int A[], int n)
{
	int i;

	for (i = 0; i < n; i++)
	{
		cin >> A[i];
	}

	return;
}

void find(int num, int size)
{
	int left = 0, mid, right = size - 1;

	while (right >= left)
	{
		mid = (left + right) / 2;
		if (num == A[mid])
		{
			cout << "1\n";
			return;
		}
		else if (num < A[mid])
		{
			right = mid - 1;
		}
		else//(num > A[mid])
		{
			left = mid + 1;
		}
	}
	cout << "0\n";

	return;
}

void find_result(int N, int M)
{
	int i, temp;

	for (i = 0; i < M; i++)
	{
		cin >> temp;
		find(temp, N);
	}

	return;
}

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N, M;

	cin >> N;
	input_arr(A, N);
	sort(A, A + N);
	cin >> M;
	find_result(N, M);

	return 0;
}