Submission #484430

#	Time	Username	Problem	Language	Result	Execution time	Memory
484430		maxshev	Knapsack (NOI18_knapsack)	C++14	0 / 100	1081 ms	204 KiB

knapsack

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

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

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

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

  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