Submission #126901

#	Time	Username	Problem	Language	Result	Execution time	Memory
126901		toonewbie	Art Exhibition (JOI18_art)	C++17	100 / 100	266 ms	24840 KiB

art

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

#define ll long long
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define all(v) (v).begin(),(v).end()

using namespace std;

const int N = 500005;
const int INF = 1000000000;
const ll INFLL = 1LL * INF * INF;

pair <ll, int> a[N];
ll p[N];
int main() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].F >> a[i].S;
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) {
        p[i] = p[i - 1] + a[i].S;
    }
    ll res = -INF;
    ll mn = -a[1].F;
    /// (p[j] - a[j].F) - (p[i - 1] - a[i].F)
    for (int i = 1; i <= n; i++) {
        res = max(res, p[i] - a[i].F - mn);
        mn = min(mn, p[i] - a[i + 1].F);
    }
    cout << res << endl;
    return 0;
}

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