백준 1920 수 찾기 c++

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

1920번: 수 찾기

그냥 set 날먹 문제구나 싶었는데

#include <iostream>
#include <unordered_set>

using namespace	std;

int	main()
{
	ios::sync_with_stdio(0),cin.tie(0);

	int N, M;
	unordered_set<int> s;
	cin >> N;
	for (int i = 0; i < N; i++) {
		int cur;
		cin >> cur;
		s.insert(cur);
	}
	cin >> M;
	for (int i = 0; i < M; i++) {
		int cur;
		cin >> cur;
		if (s.find(cur) == s.end())
			cout << 0 << endl;
		else
			cout << 1 << endl;
	}
}

시간 초과난다. => 이분탐색

#include <iostream>
#include <vector>
#include <algorithm>

using namespace	std;

int	main()
{
	ios::sync_with_stdio(0),cin.tie(0);

	int N, M;
	vector<int>	v;
	cin >> N;
	for (int i = 0; i < N; i++) {
		int cur;
		cin >> cur;
		v.push_back(cur);
	}
	sort(v.begin(), v.end());
	cin >> M;
	for (int i = 0; i < M; i++) {
		int cur;
		cin >> cur;
		if (binary_search(v.begin(), v.end(), cur))
			cout << '1' << '\n';
		else
			cout << '0' << '\n';
	}
}