For this Question: Ram is given an array <b>A</b> of length N, Ram can right-rotate the array any number of times (possibly zero times also). His task is to find out the maximum value of A<sub>1</sub> + A<sub>N</sub>.
<b>Note</b>: Right rotation of array [A<sub>1</sub>, A<sub>2</sub>,. , A<sub>N</sub>] is [A<sub>N</sub>, A<sub>1</sub>,. , A<sub>N-1</sub>].The first line of the input contains a single integer T, denoting the number of test cases.
The first line of each test case contains a single integer N, denoting the size of an array A.
The second line of each test case contains N space- separated integers denoting array A.

<b>Constraints</b>
1 &le; T &le; 1000
1 &le; N &le; 10<sup>5</sup>
1 &le; A<sub>i</sub> &le; 10<sup>9</sup>For each test case output on a new line denoting the maximum value of A<sub>1</sub> + A<sub>N</sub>.Sample Input 
3
2
5 8
3
5 10 15
4
4 4 4 4
Sample Output
13
25
8, I have written this Solution Code: #include <bits/stdc++.h>

using namespace std;

#define int long long

signed main() {
    auto start = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int tt;
    cin >> tt;
    int total = 0;
    while (tt--) {
        int n;
        cin >> n;
        total += n;
        vector<int> a(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        int maxi = a[0] + a[n - 1];
        for (int i = 0; i < n - 1; i++) {
            maxi = max(a[i] + a[i + 1], maxi);
        }
        cout << maxi << "\n";
    }
    assert(total <= 1e5);
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?