For this Question: Ann, John, and Elsa like playing games. Their favorite game is the Game of Battle War. 
In this game, the players virtually fight with each other. Each fight has two players. Suppose the initial energy of the players is L and M, then, after the fight, the energy of both players reduces by min(L, M). Let the initial energy levels of Ann, John, and Elsa be X, Y, and Z respectively. The game rules say that each pair of players can fight exactly once. 
Find out if Ann can finish the battle with a positive energy level considering that you can schedule the fights between each pair in any sequence.The first line of input will contain a single integer T, denoting the number of test cases. The first and only line of each test case contains three space- separated integers X, Y, and Z- the initial energy levels of Ann, John and Elsa.

<b>Constraints</b>
1 &le; T &le; 1000
0 &le; X, Y, Z &le; 1000For each test case, output on a new line, YES, if you can schedule the fight between each pair in an order such that Ann can have an energy level t the end of the battle. Otherwise, output NO.Sample Input :
3
4 2 0
2 7 4
5 1 4
Sample Output :
YES
NO
YES, I have written this Solution Code: #include <bits/stdc++.h>

using namespace std;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int a, b, c;
        cin >> a >> b >> c;
        int x = b - min(b, c);
        int y = c - min(b, c);
        if (x > y) {
            a = a - x;
            if (a > 0)
                cout << "YES" << endl;
            else
                cout << "NO" << endl;

        } else {
            a = a - y;
            if (a > 0)
                cout << "YES" << endl;
            else
                cout << "NO" << endl;
        }
    }
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?