# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850462 | alexz1205 | Knapsack (NOI18_knapsack) | C++14 | 1 ms | 344 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;
const int S = 2000, N = 1e5;
int arr[S+1];
int main() {
int s, n;
cin >> s >> n;
set<int> weights[s+1];
for (int x = 0; x < n; x ++){
int v, w, k;
cin >> v >> w >> k;
k = min(k, s/w);
for (int x = 0; x < k; x ++){
weights[w].insert(v);
if (weights[w].size() > (s/w)){
weights[w].erase(--weights[w].end());
}
}
}
for (int x = 1; x <= s; x ++){
for (int v: weights[x]){
for (int i = s-x; i >= 0; i --){
arr[i+x] = max(arr[i+x], arr[i]+v);
}
for (int i = 1; i <= s; i ++){
arr[i] = max(arr[i], arr[i-1]);
}
}
}
cout << arr[s] << endl;
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... |