#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<long long, long long>>art(n);
for(int i = 0; i < n; i++)
cin >> art[i].first >> art[i].second;
sort(art.begin(), art.end());
vector<long long>delta(n);
for(int i = 1; i < n; i++)
delta[i] = art[i].second - (art[i].first-art[i-1].first);
long long best = art[0].second, sum = art[0].second;
for(int i = 1; i < n; i++){
sum = max(sum+art[i-1].first-art[i].first+art[i].second, art[i].second);
best = max(best, sum);
}
cout << best << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |