제출 #1135458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135458		nuutsnoynton	Art Exhibition (JOI18_art)	C++20	100 / 100	357 ms	19912 KiB

art

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const ll N = 5e5 + 2;

pair < ll, ll > P[N];
int main() {
	ll n, m, r, x, y, i, j, mn, ans, t, mx;

	cin >> n;
	
	for (i = 1; i <= n; i ++) {
		cin >> P[i].first >> P[i].second;
	}
	
	sort ( P + 1, P + n + 1);
	ll pre[n+ 2];
	ll a[n +2 ], b[n + 2];
	
	pre[0] = 0;
	for (i = 1; i <= n; i ++) {
		pre[i] = pre[i - 1] +P[i].second;
	}
	
	for (i =1; i <= n; i ++) {
		a[i] = pre[i] - P[i].first ;
		b[i] = pre[i - 1] - P[i].first;
	}
	
	ans =0;
	mn = LONG_MAX;
	for (i = 1; i <= n; i ++) {
		mn = min(mn, b[i]);
		ans = max(ans, a[i] - mn);
	
	}
	
	cout << ans << endl;
	
	
	
	
	
}

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