백준 1920번 : 수 찾기

문제 링크 

 

#include <bits/stdc++.h>

using namespace std;

int main(void){
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, a, b;
  vector<int> v;
	cin >> n ; //5
  for(int i =0; i<n;i++){
    cin >> a;
    v.push_back(a);
  } 
  sort(v.begin(), v.end()); // 정렬

  cin >> m; //5
  for(int i=0; i<m;i++){
    cin>>b;
    if(binary_search(v.begin(),v.end(),b )) cout << 1 << "\n";
    else cout << 0 << "\n";

  }
}