B. Zero Array ——Codeforces-1201B

B. Zero Array

You are given an array a1,a2,…,an.

In one operation you can choose two elements ai and aj (i≠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.

Input
The first line contains a single integer n (2≤n≤105) — the size of the array.

The second line contains n integers a1,a2,…,an (1≤ai≤109) — the elements of the array.

Output
Print “YES” if it is possible to make all elements zero, otherwise print “NO”.

Examples
Input
4
1 1 2 2
Output
YES
Input
6
1 2 3 4 5 6
Output
NO
Note
In the first example, you can make all elements equal to zero in 3 operations:

Decrease a1 and a2,
Decrease a3 and a4,
Decrease a3 and a4
In the second example, one can show that it is impossible to make all elements equal to zero.

题意：输入一组数，对这组数进行操作，每次选两个减一，判断最后是否能全为零；
思路：非常水的一道题，首先判断这组数的和，如果是奇数的话，不可能全为零，如果是偶数的话，其中的最大值如果大于和的一半，也不可能成功。

#include<stdio.h>
#include<algorithm>
#include<math.h>
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	long long a[n];
	long long  maxx=0;
	long long sum=0;
	int flag=0;//表示是否成功 
	for(int i=0;i<n;i++)
	{
		scanf("%lld",&a[i]);
	    maxx=max(maxx,a[i]);
	    sum+=a[i];
	}
	long long mid=sum/2;
	if(sum%2!=0)
	flag=1;		
	if(maxx>mid)
	flag=1;
    
    if(flag==1)
    printf("NO\n");
    else 
    printf("YES\n");
	
}