백준 2776 암기왕

def binary_search(target, data):
#    data.sort()
    start = 0
    end = len(data) - 1
    flag=0
    while start <= end:
        mid = (start + end) // 2
        if data[mid] == target:
            flag=1;
            return flag # 함수를 끝내버린다.
        elif data[mid] < target:
            start = mid + 1
        else:
            end = mid -1
    return flag
import sys
t=int(sys.stdin.readline())
for _ in range (t):
    n=int(sys.stdin.readline())
    diary1=list(map(int, sys.stdin.readline().split()))
    diary1.sort()
    m = int(sys.stdin.readline())
    diary2=list(map(int, sys.stdin.readline().split()))
    for i in diary2:
        print(binary_search(i,diary1))

정렬 문제죠

이진탐색으로 구현해서 풀었습니다