Submission #1172326

#TimeUsernameProblemLanguageResultExecution timeMemory
1172326manowoKnapsack (NOI18_knapsack)C++20
17 / 100
0 ms332 KiB
#include <bits/stdc++.h> using namespace std; const int M = 100004; const int N = 2004; int s, n, w[M]; long long v[M], k[M], dp[N]; int main() { cin >> s >> n; for (int i = 0; i < n; i++) { cin >> v[i] >> w[i] >> k[i]; for (int j = s; j >= w[i]; j--) { dp[j] = max(dp[j], dp[j - w[i]] + v[i]); } } long long ans = 0; for (int i = 1; i <= s; i++) { ans = max(ans, dp[i]); } cout << ans << endl; 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...