[백준 1920] 수 찾기

문제설명

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

1920번: 수 찾기

코드

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n, m, temp;
vector<int> num, finds;

void binarySearch(int key){
    
    int start=0, end=num.size()-1; 
    
        while(start <= end){
            int mid = (start + end)/2;
            if(key == num[mid]){
                cout << "1\n";
                return;
            }
            if(key < num[mid]){
                end = mid - 1; 
            }
            if(key > num[mid]){
                start = mid + 1; 
            }
        }
        cout <<"0\n";
        return; 
}


int main()
{
    cin >> n;
    for(int i=0; i<n; i++){
        cin >> temp;
        num.push_back(temp);        
    }
    
    cin >> m; 
    for(int i=0; i<m; i++){
        cin >> temp;
        finds.push_back(temp);
    }
    
    sort(num.begin(),num.end());
    
    for(int i=0; i< m; i++)
        binarySearch(finds[i]);
    
    return 0;
}