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;
#define lli long long
#define INF LONG_LONG_MAX
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define endl '\n'
#define max(aa, bb) (aa > bb ? aa:bb)
#define min(aa, bb) (aa < bb ? aa:bb)
#define all(aa) aa.begin(), aa.end()
int main(){
lli n;
cin>>n;
vector<pair<lli,lli>>v(n);
for(auto &it:v){
cin>>it.st>>it.nd;
}
sort(all(v));
lli tmp=v[0].nd, cvp=0;
for(lli i=1;i<n;i++){
tmp=max(tmp-v[i].st+v[i-1].st+v[i].nd, v[i].nd);
cvp=max(cvp, tmp);
}
cout<<cvp<<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... |