Submission #49142

#TimeUsernameProblemLanguageResultExecution timeMemory
49142WLZArt Exhibition (JOI18_art)C++17
100 / 100
437 ms235212 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;

int n;

vector<pair<ll, int>> v;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> n;
    for (int i = 0; i < n; i++) {
        ll a; int b;
        cin >> a >> b;
        v.emplace_back(a, b);
    }
    sort(v.begin(), v.end());
    vector<ll> pre(n);
    vector<ll> precomp(n);
    for (int i = 0; i < n; i++) {
        pre[i] = v[i].second;
        if (i) pre[i] += pre[i - 1];
        precomp[i] = v[i].first;
        if (i) {
            precomp[i] -= pre[i - 1];
            precomp[i] = max(precomp[i], precomp[i - 1]);
        }
    }
    ll ans = -INF;
    for (int i = 0; i < n; i++) {
        ans = max(ans, pre[i] - v[i].first + precomp[i]);
    }
    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...