1146: eat candy

1146: Eat candy

Title Description
HOHO, Finally from Speakless I won all the candy in my hand , yes Gardon There is a special hobby when eating candy , I just don't like eating the same candy twice in a row , I like to eat one first A All kinds of candy , Another taste next time , Take one B All kinds of candy , such ; But Gardon I don't know if there's a sort of order in which he can eat all the candy ？ Please write a program to help calculate .
Input
The first line has an integer T, Next T Group data , The percentage of data in each group 2 That's ok , The first line is an integer N（0 < N <= 1000000), Indicates the type of candy . The second line is N Number , Indicates the number of each kind of candy Mi(0 < Mi <= 109).
Output
For each set of data , Output one line , Contains a "Yes" perhaps "No".
The sample input Copy
2
3
4 1 1
5
5 4 3 2 1
Sample output Copy
No
Yes
source / classification

#include<stdio.h>
#include<string.h>
#define N 1000
/*  Eat candy   Two adjacent flavors cannot be repeated   Find the most , The rest and ＋1<=max max>sum-max+1  When output no */ 
int main(){
    
    int t,n,k,sum=0,max=0;
    scanf("%d",&t);
    while(t--){
    
        max=sum=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
    
            scanf("%d",&k);
            sum+=k;
            if(k>max) max=k;
        }
        if(2*max-1>sum) printf("No\n");
        else printf("Yes\n");
    }
	return 0;
}