For this Question: A balanced parentheses sequence is a sequence of parentheses such that each opening parenthesis has a matching closing parenthesis and the pairs of parentheses are properly nested. In other words, a balanced parentheses sequence must satisfy the following conditions:

The sequence is empty, or The sequence is of the form "(S)", where S is a balanced parentheses sequence, or The sequence is of the form "S1S2", where S1 and S2 are balanced parentheses sequences. For example, the following are balanced parentheses sequences:

""
"()"
"((()))"
"()()()"
"(()(()))"

And the following are not balanced parentheses sequences:

"("
")"
"()("
"(()"
"(()))"
"())("

Now, you are given two integers, A and B where A denotes the number of opening brackets i. e: ( and B denotes the number of closing brackets i. e: ). You need to report if you can build balanced parentheses using all of those brackets.The input consists of two space separated integers A and B.

<b>Constraints</b>
0 &le; A, B &le; 10^9Print "YES" (without quotes) if you can build a balanced parentheses using the given brackets, otherwise print "NO" (without quotes).<b>Sample Input 1</b>
2 1
<b>Sample Output 1</b>
NO

<b>Sample Input 2</b>
10 10
<b>Sample Output 2</b>
YES, I have written this Solution Code: #include"bits/stdc++.h"

using namespace std;

signed main() {
    int x,y;
    cin>>x>>y;
    if(x==y)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?