#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <stdlib.h>
#define ll long long
using namespace std;
ll a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q,t[500005];
map<ll,ll> maa,mii,mee;
vector<ll> vj,vo,vi;
pair<ll,ll> k[500005];
int main(){
cin>>a;
for(i=0 ; i<a ; i++){
cin>>k[i].first>>k[i].second;
}
sort(k,k+a);
t[0]=k[0].second;
for(i=1 ; i<a ; i++){
t[i]=max(k[i].second,t[i-1]+k[i].second-(k[i].first-k[i-1].first));
}
g=-10000000000000;
for(i=0 ; i<a ; i++){
g=max(g,t[i]);
}
cout<<g<<endl;
}
# | 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... |