# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1044896 | codeiskiwi | Knapsack (NOI18_knapsack) | C++17 | 1060 ms | 4508 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int s, n;
long long v[100001], w[100001], k[100001];
long long dp[100001];
int main(){
scanf("%d%d", &s, &n);
for(int i=1; i<=n; i++){
scanf("%lld%lld%lld", &v[i], &w[i], &k[i]);
}
for(int i=1; i<=n; i++){
for(int j=s; j>=w[i]; j--){
for(int kk=0; kk<=k[i]; kk++){
if (j-kk*w[i]<0) break;
dp[j]=max(dp[j], dp[j-kk*w[i]]+kk*v[i]);
}
}
}
printf("%lld", dp[s]);
}
Compilation message (stderr)
# | 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... |