For this Question: You are given an array A of size N. In one move, you can swap any two elements of this array. Find out whether you can make this array strictly increasing or not after any (possibly 0) number of moves.The first line of the input contains a single integer N.
The second line of the input contains N space seperated integers.

Constraints:
1 <= N <= 10<sup>5</sup>
1 <= A<sub>i</sub> <= 10<sup>6</sup>Print "YES", if you can make the array strictly increasing, else print "NO", without the quotes.Sample Input:
5
5 9 4 5 3

Sample Output:
NO

Explaination:
After any number of moves, you cannot make this array strictly increasing., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(auto &i : a) cin >> i;
    sort(a.begin(), a.end());
    for(int i = 1; i < n; i++){
        if(a[i] == a[i - 1]){
            cout << "NO";
            return 0;
        }
    }
    cout << "YES";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?