第一关：二分查找

#include<iostream>
using namespace std;
class BinarySearch
{
public:
	int n, m, * arry; bool* flag;
	void init_arry()
	{
		cin >> n;
		arry = new int[n];
		for (int i = 0; i < n; i++)
		{
			if (arry != NULL) cin >> arry[i];
		}
	}
	bool search(int a[], int low, int high, int k)
	{
		int mid;
		if (low <= high)
		{
			mid = (low + high) / 2;
			if (a[mid] == k)
				return true;
			else if (a[mid] > k)
				return search(a, low, mid - 1, k);
			else
				return search(a, mid + 1, high, k);
		}
		else
			return false;
	}
	void cout_flag()
	{
		cin >> m;
		flag = new bool[m];
		for (int i = 0; i < m; i++)
		{
			int k;
			cin >> k;
			if (flag != NULL) flag[i] = search(arry, 0, n - 1, k);
		}
		for (int i = 0; i < m; i++)
		{
			if (flag[i] == true) cout << "Yes" << endl;
			else cout << "No" << endl;
		}
	}
};
int main()
{
	BinarySearch BinSearch;
	BinSearch.init_arry();
	BinSearch.cout_flag();

	return 0;
}