B. Zero Array

传送门

B. Zero Array

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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 a1and a2
Decrease a3and a4
Decrease a3 and a4
In the second example, one can show that it is impossible to make all elements equal to zero.

题意：给你n个数，你可以每次找到两个数并且让它们都减去1.判断可不可以进行操作后最后这n个数都变成0。

思路：先对这n个数求和，如果为奇数不可能满足条件。如果为偶数，还得进行判断里面最大数是否小于剩下n-1个数的和。如果最大数大于剩下数的和则同样不满足。

代码

#include<stdio.h>
  #include<string.h>
  #include<iostream>
 #include<algorithm>
  using namespace std;
  int main()
  {
      long long n,sum=0,a,maxn=0;
      scanf("%I64d",&n);
     for(long long i=0;i<n;++i)
     {
         scanf("%I64d",&a);
         sum+=a;
        maxn=max(maxn,a);
    }
     if(sum-maxn>=maxn)
     {
         if(sum%2)
             printf("NO\n");
         else printf("YES\n");
     }
     else printf("NO\n");
 }