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 <iostream>
#include <fstream>
#include <algorithm>
#include <climits>
using namespace std;
const int nmax=500005;
pair<long long,int> v[nmax];
int n,i;
long long mn,s,ans;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i].first>>v[i].second;
}
sort(v+1,v+n+1);mn=LLONG_MAX;
for(i=1;i<=n;i++)
{
mn=min(mn,1LL*s-v[i].first);
s+=1LL*v[i].second;
ans=max(ans,1LL*s-mn-v[i].first);
}
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... |