백준 알고리즘 1920번 수 찾기

#include <iostream>
#include <algorithm>
#define MAX 100000
 
using namespace std;
 
int N,array_N[MAX];
int b_search(int M);
 
int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int M, n;
    cin >> N;
    for(int i=0;i<N;i++) {
        cin >> array_N[i];
    }
    sort(array_N, array_N + N);
    cin >> M;
    for(int i=0;i<M;i++) {
        cin >> n;
        cout << b_search(n) << "\n"; //endl로 처리시 시간초과
    }
}
 
int b_search(int M) {
    int start=0;
    int end=N-1;
    
    while(start <= end) {
        int mid = (start+end)/2;
        if(array_N[mid] == M) return 1;
        else if(array_N[mid] < M) start = mid + 1;
        else end = mid-1;
    }
    return 0;
}