HDU 1205

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

int main()
{
    int t,n,x;
    long long maxn,all;
    scanf("%d",&t);
    while(t--)
    {
        maxn=0;all=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&x);
            maxn=maxn>x?maxn:x;
            all+=x;
        }
        if(maxn > all - maxn + 1)
            printf("No\n");
        else printf("Yes\n");
    }
    return 0;
}