Submission #593264

#TimeUsernameProblemLanguageResultExecution timeMemory
593264daisy2Art Exhibition (JOI18_art)C++14
100 / 100
490 ms9408 KiB
#include<iostream>
#include<algorithm>
using namespace std;
pair<long long, long long> p[500005];
long long n;
int main()
{
    cin>>n;

    for(int i=0;i<n;i++)
    {
        cin>>p[i].first>>p[i].second;
    }
    sort(p,p+n);

    long long mi=1000000000000000,ma=-1000000,pref=0;
    for(int i=0;i<n;i++)
    {
        mi=min(mi,pref-p[i].first);
        pref+=p[i].second;
        ma=max(ma,pref-p[i].first-mi);

    }
    cout<<ma<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...