1201 B B. Zero Array

									B. Zero Array
							time limit per test1 second
							memory limit per test256 megabytes
							inputstandard input
							outputstandard output

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.
题意： 给出一个数组，每次从中选择任意两个数同时减1，问最终能不能将数组中的所有数变为0.
思路： 首先容易想到记录数组的和，和为奇数显然是不能的，如果和为偶数，则需要判断该数组中的最大数与剩余数组和的大小进行比较，如果该最大数小于等于除该值的数组和，则可以满足题意，否则输出NO。

#include <iostream>
#include <cstring>
#include <map>
using namespace std;
typedef long long ll;
int main() {
	int a[100005];
	int n, maxn = 0;
	scanf("%d", &n);
	ll sum  = 0;
	for (int i = 0; i < n ; i++) {
		scanf("%d", &a[i]);
		maxn = max(maxn, a[i]); 
		sum += (ll)a[i];
	}
	if (sum % 2 == 0) {
		ll ans = sum - maxn;
		if (ans >= maxn) {
			printf("YES\n");
		} else {
			printf("NO\n");
		}			
	} else printf("NO\n");
	return 0;
}