BOJ2776 : 암기왕

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>

using namespace std;

int main()
{
    int T, N, M;
    int number1[1000000];
    int number2[1000000];
    scanf("%d", &T);
    for (int i = 0; i < T; i++)
    {
        scanf("%d", &N);
        for (int j = 0; j < N; j++)
            scanf("%d", number1 + j);
        sort(number1, number1 + N);
        scanf("%d", &M);
        for (int j = 0; j < M; j++)
        {
            scanf("%d", number2 + j);
            printf("%d\n", binary_search(number1, number1 + N, number2[j]));
        }
    }
}