Submission #1172328

#TimeUsernameProblemLanguageResultExecution timeMemory
1172328nagibatorKnapsack (NOI18_knapsack)C++20
17 / 100
0 ms328 KiB
#include <bits/stdc++.h> #define nn '\n' #define int long long #define pb push_back #define all(x) x.begin(), x.end() #define sec second #define vec std::vector using namespace std; const int N = 2005; vec<pair<int, int>> p; int dp[N]; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n , m ; cin >> n >> m; for (int i = 0; i < m; i++) { int a , b , c; cin >> a>> b >> c; for (int j = n; j >= b; j--) { dp[j] = max(dp[j], dp[j - b] + a); } } int ans = 0; 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...