Submission #484279

#	Time	Username	Problem	Language	Result	Execution time	Memory
484279		maxshev	Knapsack (NOI18_knapsack)	C++14	0 / 100	1 ms	972 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

int main() {
  int s, n;
  cin >> s >> n;

  vector<int> v(n + 1), w(n + 1), k(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> v[i] >> w[i] >> k[i];
  }

  vector<vector<int>> dp(n + 1, vector<int>(s + 1));
  for (int i = 1; i <= n; i++) {
    for (int x = 1; x <= s; x++) {
      if (x >= w[i]) {
        dp[i][x] = max(dp[i - 1][x], dp[i - 1][x - w[i]] + v[i]);
      }
    }
  }

  cout << dp[n][s] << '\n';
  return 0;
}

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