# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105961 | 2024-10-28T15:26:19 Z | Rolo678 | Gym Badges (NOI22_gymbadges) | C++14 | 920 ms | 1048576 KB |
#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'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 920 ms | 1048576 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |