#include <bits/stdc++.h>
using namespace std;
int main() {
int s,n;
cin >> s >> n;
vector<int> weights;
vector<int> values;
for (int i = 0; i < n; i++) {
int vi, wi, ki;
cin >> vi >> wi >> ki;
for (int j = 0; j < ki; j++) {
weights.push_back(wi);
values.push_back(vi);
}
}
vector<vector<int> > dp(weights.size()+1,vector<int>(s+1,0));
for (int i = 0; i <= s; i++) {
dp[0][i]=0;
}
for (int i = 1; i <= weights.size(); i++) {
for (int j = 1; j <= s; j++) {
dp[i][j]=dp[i-1][j];
if (j>=weights[weights.size()-i]) {
dp[i][j]=max(dp[i][j],dp[i-1][j-weights[weights.size()-i]]+values[weights.size()-i]);
}
}
}
cout << dp[weights.size()][s];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |