Codeforces Round 859 (Div. 4) G. Subsequence Addition

Codeforces Round 859 (Div. 4) G1. Subsequence Addition (Easy Version)

Codeforces Round 859 (Div. 4) G2. Subsequence Addition (Hard Version)

假设一个序列里面有 $a_1，a_2，a_3，a_4，a_5，...a_k$，那么这个子序列的和可以表示出[1，$\sum a_i$ ] 内的所有数字。

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

void solve()
{
    int n;cin>>n;
    vector<int> a(n);
    for(int i=0;i<n;i++) cin>>a[i];
    sort(a.begin(),a.end());
    long long res=a[0];
    if(res!=1)
    {
        cout<<"NO"<<endl;
        return ;
    }
    for(int i=1;i<n;i++)
    {
        if(a[i]>res)
        {
            cout<<"NO"<<endl;
            return ;
        }
        res+=a[i];
    }
    cout<<"YES"<<endl;
}

int main()
{
    int T;cin>>T;
    while(T--) solve();
    return 0;
}