| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1221428 | mifzal5331 | Knapsack (NOI18_knapsack) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int kapasitas, barang;
cin >> kapasitas >> barang;
vector<int> harga(barang), berat(barang), stok(barang);
for (int i = 0; i < barang; i++) {
cin >> harga[i] >> berat[i] >> stok[i];
}
// Group items by weight
map<int, vector<pair<int, int>>> byBerat;
for (int i = 0; i < barang; i++) {
byBerat[berat[i]].push_back(harga[i], stok[i]);
}
vector<pair<int, int>> items; // (total_weight, total_value)
for (auto &[w, group] : byBerat) {
sort(group.rbegin(), group.rend()); // sort by value descending
int maxAllowed = kapasitas / w;
for (auto &[v, s] : group) {
int take = min(s, maxAllowed);
maxAllowed -= take;
for (int k = 1; take > 0; k <<= 1) {
int batch = min(k, take);
take -= batch;
items.push_back(w * batch, v * batch);
}
if (maxAllowed == 0) break;
}
}
vector<ll> dp(kapasitas + 1, 0);
for (auto &[beratItem, nilaiItem] : items) {
for (int j = kapasitas; j >= beratItem; j--) {
dp[j] = max(dp[j], dp[j - beratItem] + nilaiItem);
}
}
cout << dp[kapasitas] << endl;
}