For this Question: There are N types of virus also each virus has an affinity equal to A[i]. You want to find the top 10 virus with the highest affinity.

Expected Time Complexity: O(N)First line contains an integer N.
Next line contains N space separated integers denoting elements of array.

Constraints
10 <= N <= 10^7
1 <= Ai <= 10^5Print the affinity of top 10 virus in sorted order.Sample Input 1:
10
1 2 3 4 5 6 7 8 9 10

Output 
1 2 3 4 5 6 7 8 9 10

Sample Input 2:
15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Output 
6 7 8 9 10 11 12 13 14 15
, I have written this Solution Code: #include <bits/stdc++.h>

using namespace std;

#define int long long

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif

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