# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100450 | baoheyhey | Knapsack (NOI18_knapsack) | C++17 | 1 ms | 504 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>
#define MAXN 100004
#define MAXS 2004
using namespace std;
int s,n,w[MAXN];
long long v[MAXN],k[MAXN],dp[MAXS];
int main(){
scanf("%d %d",&s,&n);
for(int x=0;x<n;x++){
scanf("%lld %d %lld",&v[x],&w[x],&k[x]);
for(int y=s;y>=w[x];y--){
dp[y]=max(dp[y],dp[y-w[x]]+v[x]);
}
}
long long ans=0;
for(int x=1;x<=s;x++) ans=max(ans,dp[x]);
printf("%lld\n",ans);
return 0;
}
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... |