For this Question: Given an array in which all numbers except two are repeated once. (i. e. we have 2N+2 numbers and N numbers are occurring twice and remaining two have occurred once). Find those two numbers.First line of input contains a single integer N. The next line of input contains 2*N+2 space separated integers.

Constraints:-
1 < = N < = 10000
1 < = Arr[i] < = 100000000Print the two elements separated by space (print the lower element first).Sample Input:-
2
1 3 4 1 5 3

Sample Output:-
4 5

Sample Input:-
3
1 2 3 5 4 3 2 1

Sample Output:-
4 5, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;



int main(){


int n;
cin>>n;
int x=2*n+2;
long long  a[x];
for(int i=0;i<x;i++){
    cin>>a[i];
}
sort(a,a+x);
int j=1;

for(int i=j;i<x;i+=2){
        if(a[i]!=a[i-1]){cout<<a[i-1]<<" ";i--;}
}
if(a[x-1]!=a[x-2]){cout<<a[x-1];}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?