Submission #108156

#	Time	Username	Problem	Language	Result	Execution time	Memory
108156		RockyB	Art Exhibition (JOI18_art)	C++17	100 / 100	255 ms	21008 KiB

art

/// In The Name Of God

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
pair <ll, ll> a[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n;
	rep(i, 1, n) cin >> a[i].f >> a[i].s;
	sort (a + 1, a + 1 + n);
	ll mx = -linf, ans = 0, s = 0;
	/*
	rep(i, 1, n) {
		s = 0;
		per(j, i, 1) {
			s += a[j].s;
			//ans = max(ans, s - (a[i].f - a[j].f));
		}
	}*/
	s = 0;
	/// s_i - af_i - s_j-1  + af_j
	//cout << ans;
	//ioi
	rep(i, 1, n) {
		mx = max(mx, a[i].f - s);
		s += a[i].s;
		ans = max(ans, s - a[i].f + mx);
	}
	cout << ans;
	ioi
}

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