제출 #1055476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1055476		alex_2008	Art Exhibition (JOI18_art)	C++14	100 / 100	296 ms	20916 KiB

art

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#define ff first 
#define ss second
using namespace std;
typedef long long ll;
const int N = 500010;
pair<ll, ll> a[N];
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].ff >> a[i].ss;
	}
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; i++) {
		a[i].ss += a[i - 1].ss;
	}
	ll mx = -1000000000000000000;
	ll ans = -1000000000000000000;
	for (int i = 1; i <= n; i++) {
		mx = max(mx, a[i].ff - a[i - 1].ss);
		ans = max(ans, a[i].ss - a[i].ff + mx);
	}
	cout << ans << "\n";
}

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