Submission #1049835

#	Time	Username	Problem	Language	Result	Execution time	Memory
1049835		vjudge1	Art Exhibition (JOI18_art)	C++17	0 / 100	0 ms	348 KiB

art

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pll pair<ll, ll>
#define fi first
#define se second
#define all(x) begin(x), end(x)
int main() {
    int n;
    cin >> n;
    vector<pll> a(n);
    for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se;
    sort(all(a));
    ll pref[n+1]{}, ans = 0ll;
    pref[0] = a[0].se;
    for(int i = 1; i < n; i++) pref[i] = pref[i-1] + a[i].se;
    for(int i = 0; i < n; i++) {
        int l = i, r = n;
        while(l + 1 < r) {
            int m = (l + r) / 2;
            if(a[i].se + a[i].fi >= a[m].fi) l = m;
            else r = m;
        }
        if(a[i].se + a[i].fi >= a[l].fi) ans = max(ans, pref[l] - (i ? pref[i-1] : 0ll) - a[l].fi + a[i].fi);
    }
    cout << ans;
}

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