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>
#define N 500002
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
using namespace std;
int n,x,y,ans=-1e17,t[N];
vector<pii>a;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x>>y;
a.push_back({x,y});
}
sort(a.begin(),a.end());
t[1]=a[0].se-a[0].fi;
for(int i=1;i<=n;i++)
{
if(i!=1)t[i]=t[i-1]+a[i-1].se-a[i-1].fi+a[i-2].fi;
//cout<<t[i]<<endl;
}
int mn=1e17;
for(int i=1;i<=n;i++)
{
ans=max(ans,a[i-1].se);
ans=max(ans,t[i]-mn);
mn=min(mn,t[i]-a[i-1].se);
}
cout<<ans;
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... |