Submission #539422

#TimeUsernameProblemLanguageResultExecution timeMemory
539422AntekbArt Exhibition (JOI18_art)C++14
100 / 100
567 ms20936 KiB
#include<bits/stdc++.h>
#define st first
#define nd second
using namespace std;
using ll=long long;

int main(){
    int n;
    cin>>n;
    vector<pair<ll, int> > V(n);
    for(auto &i:V){
        cin>>i.st>>i.nd;
    }
    sort(V.begin(), V.end());
    ll s=0, m=-1e15;
    ll ans=-1e15;
    for(int i=0; i<n; i++){
        //cout<<s<<" "<<m<<" "<<V[i].st<<" "<<V[i].nd<<"\n";
        if(i)ans=max(ans, s+m-V[i-1].st);
        m=max(m, V[i].st-s);
        s+=V[i].nd;
    }
    ans=max(ans, s+m-V[n-1].st);
    cout<<ans<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...