CodeForce-Solved-Problem/B_Grab_the_Candies.cpp at master · vikashship/CodeForce-Solved-Problem · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        vector<int> a(n);
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        sort(a.begin(), a.end(), greater<int>());
        int mihai = 0, bianca = 0;
        bool possible = true;
        for (int i = 0; i < n; i++)
        {
            if (a[i] % 2 == 0)
            {
                mihai += a[i];
            }
            else
            {
                bianca += a[i];
            }
            if (bianca >= mihai)
            {
                possible = false;
                break;
            }
        }
        if (possible)
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    return 0;
}