Codeforces Round #577 (Div. 2) 1201B - Zero Array

#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define pb push_back
#define all(a) a.begin(),a.end()
#define i64 long long int
const double pi = 2*acos(0) ;
const int maxn = (i64)2e5+5;

int main()
{
    int n,i;
    cin>>n;
    int arr[n];
    int mx = 0;
    i64 sum = 0;
    for(i = 0 ; i<n ; i++)
    {
        cin>>arr[i];
        sum += arr[i];
        mx = max(mx,arr[i]);
    }
    bool dgt = sum&1;
    if(dgt == 1) pf("NO");
    else
    {
        if((sum-mx)>=mx) pf("YES");
        else pf("NO");
    }

return 0;
}