Submission #484273

#TimeUsernameProblemLanguageResultExecution timeMemory
484273maxshevKnapsack (NOI18_knapsack)C++14
0 / 100
1 ms204 KiB
#include <bits/stdc++.h> using namespace std; int main() { /* ifstream fin("knapsack.in"); */ int s, n; cin >> s >> n; int v[2001], w[2001], k[2001]; for (int i = 1; i <= n; i++) { cin >> v[i] >> w[i] >> k[i]; } int dp[2001]; for (int i = 1; i <= n; i++) { for (int j = s; j >= 0; j--) { if (j >= w[i]) { dp[j] = max(dp[j], dp[j - w[i]] + v[i]); } } } cout << dp[s] << '\n'; return 0; }
#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...