Submission #704452

#	Time	Username	Problem	Language	Result	Execution time	Memory
704452		GrandTiger1729	Art Exhibition (JOI18_art)	C++17	100 / 100	231 ms	24380 KiB

art

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

const long long INF = 1e18;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    pair<long long, long long> a[n];
    for (int i = 0; i < n; i++)
        cin >> a[i].first >> a[i].second;
    sort(a, a + n);
    long long pref[n + 1]{};
    for (int i = 0; i < n; i++)
        pref[i + 1] = pref[i] + a[i].second;
    priority_queue<long long, vector<long long>, greater<long long>> pq;
    long long ans = -INF;
    for (int i = 0; i < n; i++){
        pq.push(pref[i] - a[i].first);
        ans = max(ans, pref[i + 1] - a[i].first - pq.top());
    }
    cout << ans << '\n';
    return 0;
}

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