You are given an array a1,a2,…,ana1,a2,…,an.
In one operation you can choose two elements aiai and ajaj (i≠ji≠j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
The first line contains a single integer nn (2≤n≤1052≤n≤105) — the size of the array.
The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) — the elements of the array.
Print "YES" if it is possible to make all elements zero, otherwise print "NO".
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
const double PI=3.1415926535897931;
const long long sale=1e9+10;
const int MA= 1e7+10;
const int ma= 2*1e5+10;
const int few=1e3+10;
using namespace std;
//////////////////////////////////////////////
int main()
{
int n;
cin>>n;
long long sum=0,maxx=-1,a;
for(int i=0; i<n; i++)
{
cin>>a;
maxx=max(maxx,a);
sum+=a;
}
if(maxx>sum/2||(sum%2))
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
return 0;
}