For this Question: Given an array of N integers, You have to find the maximum product of two integers.The first line of input contains a single integer N. The next line of input contains N space separated integers.

Constraints:-
2 <= N <= 100000
-10000 <= Arr[i] <= 10000Print the maximum product of two elements.Sample Input:-
5
-1 -2 3 4 -5

Sample Output:-
12

Explanation:-
4*3 = 12

Sample Input:-
4
-1 -1 1 1

Sample Output:-
1, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){

int n,l;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
    cin>>a[i];
}
sort(a,a+n);
int res = max(a[0]*a[1],a[n-1]*a[n-2]);
cout<<res;

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