Submission #1316088

#TimeUsernameProblemLanguageResultExecution timeMemory
1316088ttamxArt Exhibition (JOI18_art)C++17
100 / 100
120 ms12092 KiB
#include<bits/stdc++.h>

using namespace std;

using ll = long long;

const int N=5e5+5;
const ll INF=LLONG_MAX/2;

int n;
pair<ll,ll> a[N];
ll psum[N];
ll ans=0,mx=-INF;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> a[i].first >> a[i].second;
    }
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        psum[i]=psum[i-1]+a[i].second;
    }
    for(int i=1;i<=n;i++){
        mx=max(mx,-psum[i-1]+a[i].first);
        ans=max(ans,psum[i]-a[i].first+mx);
    }
    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...