제출 #984661

#제출 시각아이디문제언어결과실행 시간메모리
984661Sandarach151Knapsack (NOI18_knapsack)C++17
0 / 100
2 ms1116 KiB
#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int s, n; cin >> s >> n; int w[n], v[n], k[n]; for(int i=0; i<n; i++){ cin >> v[i] >> w[i] >> k[i]; } int ans[n][s+1]; for(int i=0; i<n; i++){ for(int j=0; j<=s; j++){ ans[i][j] = 0; for(int kk=0; kk<=k[i]; kk++){ if(j-w[i]*kk>=0 && i>0) ans[i][j] = max(ans[i][j], ans[i-1][j-w[i]*kk]+v[i]*kk); else break; } } } cout << ans[n-1][s] << '\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...