[백준] 숫자 카드 - 10815번

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

10815번: 숫자 카드

#include <stdio.h>
#include <vector>
#include <algorithm>
 
int main(void)
{
    int num, checknum;
    scanf("%d", &num);
    std::vector<int> card(num);
    for(int i=0;i<num;i++){
        scanf("%d", &card[i]);
    }
    scanf("%d", &checknum);
 
    std::vector<int> check(checknum);
    for(int i=0;i<checknum;i++){
        scanf("%d", &check[i]);
    }
 
    std::sort(card.begin(),card.end());
    
    for(int i=0;i<checknum;i++){
        int begin = 0;
        int end = num -1;
        int mid = num>>1;
        int exist=0;
 
        while(begin <= end){
            if(card[mid] < check[i]){
                begin = mid+1;
                mid = (begin + end)>>1;
            }
            else if(card[mid] > check[i]){
                end = mid-1;
                mid = (begin + end)>>1;
            }
            else{
                exist = 1;
                break;
            }
            //printf("%d %d %d\n",begin,mid,end);
        }
        printf("%d ", exist);
    }
    return 0;
}