HDU--1205---喫糖果
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 27152 Accepted Submission(s): 7684
#include<stdio.h>
#include<algorithm>
using namespace std;
const int maxn = 1000000+10
//全局變量
long long a[maxn]; //因爲糖果的數目介於0和1000000之間,提示我要用long long ...
int main()
{
int i,j,T,n;
long long sum;
long long max;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n); //排序
max=a[n-1];
sum=0;
for(i=0;i<n-1;i++) //求除最大值之外其他數字的和
sum=sum+a[i];
if(sum>=max-1)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}