For this Question: Given a sorted array A having N integer elements, find if there exists any pair of elements such that (A[i], A[j]) have the sum equal to X (i < j)The first line of input contains T, denoting the number of testcases. The first line of each test case contains N size of array and X. Second line contains elements of array separated by space.

Constraints:
1 <= T <= 100
1 <= N <= 100000
1 <= X <= 1000
1 <= A[i] <= 1000000For each test case you need to print "Yes" if pair exists otherwise "No".Input:
2
5 4
1 2 3 4 5
5 6
2 3 5 7 8

Output:
Yes
No, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){

    
int t;
cin>>t;
while(t--){
    vector<long> pos,neg;
    int n;
    cin>>n;
    long x;
    cin>>x;
    long long a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int i=0,j=n-1;
    while(i!=j){
        if((a[i]+a[j])>x){j--;}
        else if((a[i]+a[j])<x){i++;}
        else {cout<<"Yes"<<endl;goto f;}
    }
    cout<<"No"<<endl;
    f:;

}

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