For this Question: You are given an array A of size N, and you are also given a sum. You need to find if two numbers in A exists such that their sum is equal to the given sum. If yes, print 1, else print 0.The first line contains N denoting the size of the array A and target sum. The second line contains N elements of the array. The third line contains element sum.

Constraints:
1 <= N <= 100000
1 <= A[i] <= 1000000Print 1, if there is an occurrence of the sum, else print 0.Sample Input
10 14
1 2 3 4 5 6 7 8 9 10

Sample Output
1

Explanation 
10 + 4 = 14,  so pair exists

Sample Input
5 9
1 2 3 4 5 

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

#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pii pair<int,int>
#define mm (s+e)/2
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define sz 200000
int dp[sz];
signed main()
{
	

		int n,k;
		cin>>n>>k;
		int A[n];
		set<int> ss;
		int ch=0;
		for(int i=0;i<n;i++)
		{
			int a;
			cin>>a;
			A[i]=a;
			int p=k-a;
			if(ss.find(p)!=ss.end()) ch=1;
			ss.insert(a);


		}
		cout<<ch<<endl;
	
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?