Blue Bridge Cup_ Xiao Lan eats candy_ Pigeon nest principle / drawer principle

//
#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
const int N=1e6+7;
LL in[N];

int main()
{
    LL n,i,sum,tt;

    while( cin>>n )
    {
        sum=tt=0;
        for( i=0;i<n;i++ )
        {
            cin>>in[i];
            sum+=in[i];
            tt=max( tt,in[i] );
        }
        if( sum-tt > tt-1 ) cout<<"Yes"<<endl;
        else                cout<<"No"<<endl;
    }
    return 0;
}