Submission #921924

#	Time	Username	Problem	Language	Result	Execution time	Memory
921924		bean	Art Exhibition (JOI18_art)	C++17	100 / 100	134 ms	21076 KiB

art

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

void solve() {
    int n;
    cin >> n;
    vector<pair<ll, ll>> v(n);
    for (auto &[f, s] : v) cin >> f >> s;
    sort(v.begin(), v.end());
    ll ans = 0, mx = 0;
    for (int i = 0; i < n; i++) {
        ans = max(ans, v[i].second + mx);
        if (i != n - 1) 
            mx = max(0ll, mx + v[i].second - (v[i + 1].first - v[i].first));
    }
    cout << ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int tt = 1;
    // cin >> tt;

    while (tt--) {
        solve();
    }

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50