HDU 1205 吃糖果 鸽巢原理

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
#define fi(n) for(i=0;i<n;i++)
#define fj(m) for(j=0;j<m;j++)
#define sca(x) scanf("%d",&x)
#define scalld(x) scanf("%I64d",&x)
#define print(x) printf("%d\n", x)
#define printlld(x) printf("%I64d\n",x)
#define de printf("=======\n")

typedef long long ll;
using namespace std;

const int maxn = 1e6 + 10;
int a[maxn];

int main() {
    int t;
    sca(t);
    while( t-- ) {
        int n;
        sca(n);
        int maxnum = -1;
        int index  = -1;
        for( int i = 1; i <= n; i++ ) {
            sca(a[i]);
            if( a[i] > maxnum ) {
                maxnum = a[i];
                index = i;
            }
        }
        int sum = 0;
        int flag = 0;
        for( int i = 1; i <= n; i++ ) {
            if( index != i ) {
                sum += a[i];
            }
            if( sum >= maxnum-1 ) {
                flag = 1;
                break;
            }
        }
        if( flag ) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}