[백준] 1920번 수 찾기

import java.util.Arrays;
import java.util.Scanner;
public class Main {
	
	static int N;
	static int[] A;
	
    static boolean binarySearch(int[] A, int L,int R, int X){
        while (L <= R){
            int mid = (L+R)/2;
            if (A[mid] == X)
                return true;

            if (A[mid] < X)
                L = mid + 1;
            else
                R = mid - 1;
        }
        return false;
    }
	
	
	
	
	public static void main(String[] args) {
		Scanner kb = new Scanner(System.in);
		
		N = kb.nextInt();
		A = new int[N + 1];
		
		for(int i=1; i<=N; i++) {
			A[i] = kb.nextInt();
		}
	
		Arrays.sort(A, 1, N + 1);
		int M =kb.nextInt();
		for(int i=1; i<=M; i++) {
			int X = kb.nextInt();
			
			if(binarySearch(A, 1, N, X)) {
				System.out.println(1);
			}else {
				System.out.println(0);
			}
			
		}

	}
	
}

 

왜 Arrays.sort(A);로 하면 틀린정답이 될까~  화가 난다