#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<long long , long long>> a(n);
for (int i = 0 ; i < n ; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a.rbegin() , a.rend());
vector<long long> dp(n) , pref(n);
for (int i = 0 ; i < n ; i++) {
if (i == 0) pref[i] = a[i].second;
else pref[i] = pref[i - 1] + a[i].second;
}
for (int i = 0 ; i < n ; i++) {
for (int j = 0 ; j < i ; j++) {
dp[i] = max(dp[i] , pref[i] - (j > 0 ? pref[j - 1] : 0) - a[j].first + a[i].first);
}
}
long long res = *max_element(dp.begin() , dp.end());
cout << res << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |