Submission #1129218

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129218		jackofall718	Knapsack (NOI18_knapsack)	C++20	17 / 100	1 ms	328 KiB

knapsack

#include <bits/stdc++.h>
//NOI 2018 PRELIMS
#define ll long long int
#define endl '\n'
#define vn vector <ll>
using namespace std;
const int MAX_N = 1e9 + 7;
#define pii pair <ll,ll>
const ll INF = 0x3f3f3f3f3f3f3f3f;

#define pb push_back  

#define srt(vp) sort(vp.begin(), vp.end()) 

int main() {
  ios::sync_with_stdio(false);        
  cin.tie(nullptr);
  ll s, n;
  cin >> s >> n;
  vn weights;
  vn prices;
  map <ll, vector<ll>> items_by_value;

  for (int i = 0; i < n; i++) {
    ll v, w, k;
    cin >> v >> w >> k;
    items_by_value[w].pb(v);
  }

  
  for (auto &it : items_by_value) {
    auto &vals = it.second;
    ll weight = it.first;
    sort(vals.rbegin(), vals.rend()); 
    
    for (int i = 0; i < min((ll)vals.size(), s/weight); i++) {
      prices.pb(vals[i]);
      weights.pb(weight);
    }
  }

  vn dp(s+1, 0);
  for (int i = 0; i < weights.size(); i++) {
    for (int j = s; j >= weights[i]; j--) {
      dp[j] = max(dp[j], dp[j - weights[i]] + prices[i]);
    }
  }

  cout << dp[s] << endl;
}

• Subtask 1: 0 / 12
• Subtask 2: 17 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27