Submission #1086263

#TimeUsernameProblemLanguageResultExecution timeMemory
1086263codexistentArt Exhibition (JOI18_art)C++14
100 / 100
370 ms24912 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 500005
#define FOR(i, a, b) for(ll i = a; i <= b; i++)

ll n, pfx[MAXN], r = 0;
pair<ll, ll> w[MAXN];

int main(){
    cin >> n;
    FOR(i, 1, n) cin >> w[i].first >> w[i].second;
    sort(w + 1, w + 1 + n);

    pfx[0] = 0;
    FOR(i, 1, n) pfx[i] = pfx[i - 1] + w[i].second;

    ll mx = LLONG_MIN;
    FOR(i, 1, n){
        mx = max(mx, -pfx[i - 1] + w[i].first);

        r = max(r, (pfx[i] - w[i].first) + mx);
    }

    cout << r << 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...