Submission #776305

#	Time	Username	Problem	Language	Result	Execution time	Memory
776305		coolavy999	Knapsack (NOI18_knapsack)	C++17	100 / 100	95 ms	3608 KiB

knapsack

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int S, N, V, W, K;
vector<pair<int, int>> A[2001];
long long dp[2001], answer;
int main() {
  cin >> S >> N;
  for (int i = 0; i < N; i++) {
    cin >> V >> W >> K;
    A[W].push_back(make_pair(V, K));
  }
  for (int i = 1; i <= S; i++) {
    sort(A[i].begin(), A[i].end(), greater<pair<int, int>>());
    int index = 0;
    for (int j = 0; j < S / i; j++) {
      if (index >= A[i].size())
        break;
      for (int k = S; k >= i; k--) {
        dp[k] = max(dp[k], dp[k - i] + A[i][index].first);
        answer = max(answer, dp[k]);
      }
      A[i][index].second--;
      if (A[i][index].second == 0)
        index++;
    }
  }
  cout << answer << "\n";
  return 0;
}

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:18:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |       if (index >= A[i].size())
      |           ~~~~~~^~~~~~~~~~~~~~

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