Submission #459655

#	Time	Username	Problem	Language	Result	Execution time	Memory
459655		Hamed5001	Art Exhibition (JOI18_art)	C++14	100 / 100	248 ms	20832 KiB

art

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

void solve() {
	int N;
	cin >> N;

	vector<pair<ll, ll>> AB(N);

	for (int i = 0; i < N; ++i)
		cin >> AB[i].first >> AB[i].second;


	sort(AB.begin(), AB.end());

	for (int i = 1; i < N; i++)
		AB[i].second += AB[i-1].second;

	ll ans = AB[0].second;
	for (int l = 0, r = 1; r < N; ++r) {
		ll tmp1 = AB[r].second - (l ? AB[l-1].second : 0LL) - AB[r].first + AB[l].first;
		ll tmp2 = AB[r].second - AB[r-1].second;
		if (tmp2 >= tmp1) l = r;
		ans = max({ans, tmp1, tmp2});
	}

	cout << ans;
}

int main() {

	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

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