제출 #48474

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
48474		kyleliu	Art Exhibition (JOI18_art)	C++14	100 / 100	253 ms	222984 KiB

art

#include <bits/stdc++.h> // PLEASE

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pp;
#define MAXN 500005
#define MAXM 1005
#define MAXP 25
#define A first
#define B second
#define MP make_pair
#define PB push_back
const ll INF = 2e9+13;
const ll MOD = 1e9+7;
int N;
ll sz[MAXN], vl[MAXN];
pp ar[MAXN];
ll p[MAXN];

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> N;
	for(int i=1; i<=N; i++) cin >> ar[i].A >> ar[i].B;
	sort(ar+1, ar+N+1);
	for(int i=1; i<=N; i++) {
		sz[i] = ar[i].A; vl[i] = ar[i].B;
		p[i] = p[i-1] + vl[i];
	}
	ll mv = sz[1] - p[0];
	ll ret = vl[1];
	for(int r=1; r<=N; r++) {
		mv = max(mv, sz[r] - p[r-1]);
		ret = max(ret, p[r] + mv - sz[r]);
	}
	cout << ret << endl;
}

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