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;
typedef long long ll;
const ll N = 5e5;
const ll inf = 1e18;
pair<ll,ll> v[N];
int main(){
ll n;
ll sum = -inf;
ll ans = -inf;
cin>>n;
for(ll i = 0;i < n;i++){
cin>>v[i].first>>v[i].second;
}
sort(v,v + n);
for(ll i = 0;i < n;i++){
sum = max(sum,v[i].first);
sum = sum + v[i].second;
ans = max(ans,sum - v[i].first);
}
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... |