For this Question: Given an array of n positive integers. We are required to write a program to print the maximum product of k integers of the given array.The input line contains T, denoting the number of testcases. Each testcase contains 2 lines. First line contains size of array N and K. Second line contains elements of array

Constraints:
1 <= T <= 50
1 <= N <= 100
1 <= K <= min(N,10)
0 <= A[i] <= 100

It is guaranteed that answer will be less than 10^18.For each testcase you need to print the maximum product of K integersSample Input:
2
5 3
2 4 7 9 6
4 2
12 14 11 7

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



class Main {
	public static void main (String[] args) throws Exception {
		InputStreamReader ir = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(ir);

        String input = br.readLine();
        int t = Integer.parseInt(input);

		for(int j=0; j<t; j++) {
			String[] input1 = br.readLine().split(" ");
        	int n = Integer.parseInt(input1[0]);
        	int k = Integer.parseInt(input1[1]);

			String s[] = br.readLine().split(" ");

			long ans = 1;

			PriorityQueue<Integer> pQueue = new PriorityQueue<Integer>(Collections.reverseOrder());

			for (int i=0; i<n; i++)
				pQueue.add(Integer.parseInt(s[i]));

			for (int i=0; i<k; i++) {
				ans = ans * pQueue.poll();
			}

			System.out.println(ans);
		}
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?