For this Question: You are given the following
- An Array A of size N
- An integer h

Your task is to print number of elements in A that are greater than h. You are given a total of K such tasks.The first line contains N denoting the size of array 
The next line contains N space- separated integer denoting the elements of array A.
The next line contains an integer K denoting the number of tasks.
The next line contains an integer h.

<b>Constraints</b>
1 <= N <= 1e5
1 <= A[i] <= 1e9
1 <= K <= 1e5
1 <= h <= 1e9For each task, print the number of elements of A that are greater than h.Sample Input:
5
1 5 3 2 4
1
2

Sample Output :
3, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
    public static void main (String[] args) throws IOException {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter wr = new PrintWriter(System.out);
        int A_size = Integer.parseInt(br.readLine().trim());
        String[] arr_A = br.readLine().trim().split(" ");
        int[] A = new int[A_size];
        for (int i_A = 0; i_A < arr_A.length; i_A++) {
            A[i_A] = Integer.parseInt(arr_A[i_A]);
        }
        int K_Array_size = Integer.parseInt(br.readLine().trim());
        int[] K_Array = new int[K_Array_size];
        for (int i_K_Array = 0; i_K_Array < K_Array_size; i_K_Array++) {
            K_Array[i_K_Array] = Integer.parseInt(br.readLine().trim());
        }
        int[] out_ = process_queries(A, K_Array, A_size, K_Array_size);
        for (int i_out_ = 0; i_out_ < out_.length; i_out_++) {
            wr.println(out_[i_out_]);
        }

        wr.close();
        br.close();
    }

    static int[] process_queries(int[] A, int[] K_Array, int N, int k) {

        int ab[]=new int[k];
        Arrays.sort(A);
        int h=0;
        while(h<k)
        {    int f=K_Array[h];int l=0;
              int r=N-1;int g=N;
            while(l<=r)
            {
                int m=l+(r-l)/2;
                 if(A[m]>f)
                 {
                     g=m;
                     r=m-1;
                 }
                 else{
                     l=m+1;
                 }

            }
            ab[h]=N-g;
            h++;
        }
        return ab;

    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?