oj.uz

Submission #1105967

# Submission time Handle Problem Language Result Execution time Memory
1105967 2024-10-28T15:31:43 Z Rolo678 Gym Badges (NOI22_gymbadges) C++14
0 / 100
 865 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
  
  int n;
  cin >> n;
  vector<pair<int,pair<int,int>>>a(n+1);
  for(int i = 1;i<=n;i++)
        {
            cin >> a[i].second.first >> a[i].second.second ;
           a[i].first = a[i].second.first + a[i].second.second;
        }
  sort(a.begin(),a.end());
  vector<vector<int>>dp(n+1,vector<int>(n+1,1e15+5));
  dp[0][0] = 0;
  for(int i = 1;i<=n;i++)
  {
    for(int j = 1 ;j<=i;j++)
    {
      if(dp[i-1][j-1] <= a[i].second.second ) dp[i][j] = min(dp[i-1][j-1]+a[i].second.first, dp[i-1][j]);
      else dp[i][j] = dp[i-1][j];
    }
  }
  
  int ans = 0;
  for(int i =1;i<=n;i++)
  {
    if(dp[n][i] < 1e15+5)ans = i;
    
  }
  cout << ans << '\n';
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 865 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -