Codeforces 577B doubt

https://codeforces.com/problemset/problem/1201/B

Can some one please explain the intution behind the solution to this problem ? Is the solution related to any kind of Gametheory strategy ?

Thanks in advance

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, a, s;
int main()
{
    ios_base::sync_with_stdio(false);
    cin>>n;
    for (ll i=1; i<=n; i++)
    {
        cin>>a;
        s+=a;
        m=max(m, a);
    }
    if (s%2==1 || s<2*m)
    {
        cout<<"NO";
        return 0;
    }
    cout<<"YES";
    return 0;
}