Submission #808844

#TimeUsernameProblemLanguageResultExecution timeMemory
808844annabeth9680Art Exhibition (JOI18_art)C++17
100 / 100
156 ms24652 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int N; cin >> N;
    vector<pair<ll,ll>> art(N);
    for(int i = 0;i<N;++i) cin >> art[i].first >> art[i].second;
    sort(art.begin(),art.end());
    vector<ll> pref(N+1); pref[0] = 0;
    for(int i = 1;i<=N;++i){
        pref[i] = pref[i-1]+art[i-1].second;
    }
    ll cur = -1, ans = 0;
    for(int i = 0;i<N;++i){
        cur = max(cur,art[i].first-pref[i]);
        ans = max(ans,pref[i+1]-art[i].first+cur);
    }
    cout << ans << "\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...