Submission #710662

#	Time	Username	Problem	Language	Result	Execution time	Memory
710662		yellowtoad	Art Exhibition (JOI18_art)	C++17	100 / 100	540 ms	28764 KiB

art

#include <iostream>
#include <algorithm>
#define f first
#define s second
using namespace std;

long long n, ans, ps[500010], maxx[500010];
pair<long long, long long> a[500010];

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i].f >> a[i].s;
	sort(a+1,a+n+1);
	for (int i = 1; i <= n; i++) ps[i] = ps[i-1]+a[i].s;
	maxx[n+1] = -1e18;
	for (int i = n; i >= 1; i--) maxx[i] = max(maxx[i+1],ps[i]-a[i].f);
	for (int i = 1; i <= n; i++) ans = max(ans,maxx[i]+a[i].f-ps[i-1]);
	cout << ans << endl;
}

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