Submission #484274

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

knapsack

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

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

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

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

  int res = 0;
  for (int i = 0; i <= s; i++) {
    res = max(res, dp[i]);
  }

  cout << res << '\n';
  return 0;
}

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