[C++ 백준] 실버 4/ 1920번 수찾기

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

1920번: 수 찾기

#include <iostream>
#include<istream>
#include<algorithm>
#include <string>
 
 
using namespace std;
 
int* a;
 
int binarySearch(int *a,int target,int start,int end ){
 
    while (start <= end) {
        int mid = (start + end) / 2;
        if (a[mid] == target) {
            return 1;
        }
        else if (a[mid] > target) {
            end = mid - 1;
        }
        else {
            start = mid + 1;
        }
    }
    return 0;
}
 
int main(){
    
    
    int n;
    scanf("%d", &n);
    
    a = new int[n];
    
    for (int i = 0; i < n; i++) {
        int num;
        cin >> num;
        a[i] = num;
    }
    sort(a, a + n);
    int n2;
    scanf("%d", &n2);
    int* ans = new int[n2];
    for (int i = 0; i < n2; i++) {
        int target;
        scanf("%d", &target);
        int result = binarySearch(a, target,0, n - 1);
        printf("%d\n", result);
 
        
    }
 
    
 
 
    return 0;
}