Submission #886553

#	Time	Username	Problem	Language	Result	Execution time	Memory
886553		Halit	Gym Badges (NOI22_gymbadges)	C++17	0 / 100	697 ms	1048576 KiB

Main

#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  vector<int> X(N), L(N);
  for (int &xi : X) {
    cin >> xi;
  }
  for (int &li : L) {
    cin >> li;
  }
  vector<int> idx(N);
  iota(idx.begin(), idx.end(), 0);
  sort(idx.begin(), idx.end(), [&](int i, int j) { return make_pair(L[i], X[i]) < make_pair(L[j], X[j]); });
  int64_t INF = INT_MAX;
  vector<vector<int64_t>> dp(N+1, vector<int64_t>(N+1, INF));
  for (int i = 0;i < N; ++i) {
    dp[i][0] = 0;
  }
  dp[0][1] = X[idx[0]];
  for (int i = 1;i < N; ++i) {
    for (int j = 1;j <= N; ++j) {
      dp[i][j] = min(dp[i][j], dp[i-1][j]);
      if (dp[i-1][j-1] <= L[idx[i]]) dp[i][j] = min(dp[i][j], dp[i-1][j-1] + X[idx[i]]); 
    }
  }
  int ans = 0;
  while (ans+1 <= N && dp[N-1][ans+1] != INF) {
    ans += 1;
  }
  cout << ans << '\n';
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 9
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49