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: #include<bits/stdc++.h>
using namespace std;


int main(){

int t;
cin>>t;
while(t--){
        long long n,k;
cin>>n>>k;
 long long  a[n];
for(int i=0;i<n;i++){
    cin>>a[i];
}
sort(a,a+n);
 long long ans=1;
for(int i=n-1;i>=n-k;i--){
    ans*=a[i];
}
cout<<ans<<endl;
}}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?