제출 #531100

#제출 시각아이디문제언어결과실행 시간메모리
531100mihhKnapsack (NOI18_knapsack)C++17
73 / 100
210 ms262148 KiB
#include <bits/stdc++.h> #define db(x) cerr << #x <<":"<<x<<" " using namespace std; const int INF=1e9, MOD=1e9+7; // const int N=1e5+2; int main(){ // #ifndef ONLINE_JUDGE // freopen("frog.in", "r", stdin); // freopen("frog.out", "w", stdout); // #endif int n, kg; cin>>kg>>n; vector<vector<int>> bst(n+1,vector<int>(kg+1,0)); for(int i=1;i<=n;++i){ int v,w,k; cin>>v>>w>>k; for(int s=0;s<=kg;++s){ for(int nr=0; nr<=k and s-nr*w>=0; ++nr) bst[i][s]=max(bst[i-1][s-nr*w]+nr*v, bst[i][s]); } } int ans=0; for(int s=1;s<=kg;++s) ans=max(ans, bst[n][s]); cout<<ans; }
#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...