| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1105960 | Rolo678 | Gym Badges (NOI22_gymbadges) | C++14 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
 
int 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++)
  {
    ans = max(ans,dp[n][i]);
    
  }
  cout << ans << '\n';
}
