For this Question: You are given an array A of size N. Find the smallest sum of any two numbers (on distinct indices) possible in the array,The first line of the input contains a single integer N.
The second line of the input contains N space seperated integers.

Constraints:
2 <= N <= 10<sup>5</sup>
1 <= A<sub>i</sub> <= 10<sup>9</sup>Print the smallest sum of any two numbers (on distinct indices) possible in the array,Sample Input:
5
5 3 8 7 2

Sample Output:
5, 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());
    cout << a[0] + a[1];
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?