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;
pair<long long, long long> arr[n];
for(int i = 0;i<n;i++) {
cin >> arr[i].first >> arr[i].second;
}
sort(arr, arr+n);
long long sum = arr[0].second;
long long ans = sum;
for(int i = 1;i<n;i++) {
sum = max(sum+arr[i].second - (arr[i].first - arr[i-1].first), arr[i].second);
ans = max(ans, sum);
}
cout << ans << "\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... |