Submission #3571756

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;

#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;

int N, K, nums[5009];

bool check(int x){
    set<int> now;
    now.insert(0);
    for(int i=x+1;i<N;i++){
        set<int> nxt;
        for(auto v:now){
            nxt.insert(v);
            if(v+nums[i]>=K) continue;
            nxt.insert(v+nums[i]);
        }
        swap(now,nxt);
    }
    
    for(auto v:now){
        if(v>=K-nums[x]) return true;
    }
    return false;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>N>>K;
    rep(i,N) cin>>nums[i];
    sort(nums,nums+N);
    int lb=0, ub=N-1, mid;
    while(ub-lb>1){
        mid=(ub+lb)/2;
        if(check(mid)) ub=mid;
        else lb=mid;
    }
    int ans;
    if(lb==0){
        if(check(0)) ans=0;
        else ans=1;
    }else if(ub==N-1){
        if(!check(ub)) ans=N;
        else ans=N-1;
    }else{
        if(check(lb)) ans=lb;
        else ans=lb+1;
    }
    cout1(ans)
}

Submission Info

Judge Result