Submission #1172353

#TimeUsernameProblemLanguageResultExecution timeMemory
1172353kanatbekabiKnapsack (NOI18_knapsack)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int x = 104; int n, m, w[x] , a[x] , v[x]; int dp[104]; signed main(){ cin >> n >> m; int ans = 0; for (int i = 0; i < m; i++){ cin >> a[i]; cin >> w[i]; cin >> v[i]; for (int k = n; k >= w[i]; k--){ dp[k] = max(dp[k] , dp[k - w[i]] + a[i]); } } for (int i = 1; i <= n; i++){ ans = max(ans , dp[i]); } 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...