Submission #395760

#TimeUsernameProblemLanguageResultExecution timeMemory
395760kaplanbarArt Exhibition (JOI18_art)C++14
100 / 100
237 ms20676 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<pair<ll, ll>> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i].first >> v[i].second;
    }

    sort(v.begin(), v.end());

    ll ans = 0, cur = 0;
    ll mx = -1e18;
    for(int i = 0; i < n; i++) {
        ans = max(ans, v[i].second);
        if(i) {
            ans = max(ans, cur + v[i].second - v[i].first + mx);
        }
        mx = max(mx, v[i].first - cur);
        cur += v[i].second;
    }

    cout << ans;



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