Submission #484271

#	Time	Username	Problem	Language	Result	Execution time	Memory
484271		maxshev	Knapsack (NOI18_knapsack)	C++14	0 / 100	2 ms	332 KiB

knapsack

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

int main() {
  /* ifstream fin("knapsack.in"); */

  int s, n;
  cin >> s >> n;

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

  long dp[2001];
  for (int i = 1; i <= s; i++) {
    dp[i] = dp[i - 1];

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

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

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