Submission #1348129

#TimeUsernameProblemLanguageResultExecution timeMemory
1348129settopCandy (EGOI23_candy)C++20
100 / 100
31 ms8500 KiB
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pb push_back
const int MAXN=1e2+10;
const int inf=1e16;

int n,t,k,v[MAXN],dp[MAXN][MAXN*MAXN];

int32_t main(){
    std::ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin>>n>>k>>t;
    fall(i,1,n) cin>>v[i];
    fall(i,1,n){
        rfall(j,min(i,k),1){
            rfall(w,n*n,i-j){
                dp[j][w]=max(dp[j][w],dp[j-1][w-(i-j)]+v[i]);
            }
        }
    }
    int ans=inf;    
    rfall(j,n*n,0) if(dp[k][j]>=t) ans=j;
    if(ans==inf){
        cout<<"NO\n";
    }
    else cout<<ans<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...