Submission #1270192

#	Time	Username	Problem	Language	Result	Execution time	Memory
1270192		limits	Art Exhibition (JOI18_art)	C++20	100 / 100	122 ms	8264 KiB

art

#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue

template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int n;
	cin >> n;
	V<pl> ps(n);
	f0r(i, n) cin >> ps[i].F >> ps[i].S;
	sort(all(ps));
	ll mn = 1e16, sm = 0, ans = 0;
	f0r(i, n) {
		mn = min(mn, sm - ps[i].F);
		sm += ps[i].S;
		ans = max(ans, sm - ps[i].F - mn);
	}
	ctn(ans);
}

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