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 f first
#define s second
using namespace std;
long long n,m,ans,as[1000006];
pair<long long,long long>a[1000006];
int main ()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i].f>>a[i].s;
}
sort(a+1,a+n+1);
ans=as[1]=a[1].s;
for(int i=2;i<=n;i++)
{
long long ans1=as[i-1]+a[i].s-(a[i].f-a[i-1].f);
as[i]=max(ans1,(a[i].s));
ans=max(ans,as[i]);
}
cout<<ans;
}
# | 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... |