Submission #1097785

#	Time	Username	Problem	Language	Result	Execution time	Memory
1097785		SulA	Art Exhibition (JOI18_art)	C++17	100 / 100	143 ms	21060 KiB

art

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define bitcount __builtin_popcountll
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<long long,null_type,less_equal<>,rb_tree_tag,tree_order_statistics_node_update>;

#define int long long

struct node {
    int sum, suff;
    friend node operator+ (node l, node r) {
        return {
            l.sum + r.sum,
            max(r.suff, l.suff + r.sum)
        };
    }
};

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    int n; cin >> n;
    pair<int,int> a[n];
    for (int i = 0; i < n; cin >> a[i].first >> a[i++].second);
    sort(a, a + n);
    long long sum = 0, pref = 0, ans = (*max_element(a, a + n)).second;
    for (int i = 0; i < n; i++) {
        pref = min(pref, sum - a[i].first);
        sum += a[i].second;
        ans = max(ans, sum - a[i].first - pref);
    }
    cout << ans;
}

Compilation message (stderr)

art.cpp: In function 'int main()':
art.cpp:27:52: warning: operation on 'i' may be undefined [-Wsequence-point]
   27 |     for (int i = 0; i < n; cin >> a[i].first >> a[i++].second);
      |                                                   ~^~

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