제출 #235484

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235484		ruler	Art Exhibition (JOI18_art)	C++14	100 / 100	277 ms	28808 KiB

art

// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
 
////////////////////////////////////////////////////////////////////

const int N = 5e5 + 5;

int B[N], P[N];
ll A[N], DP[N], S[N];

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	mt19937 Rnd(time(0));

	int n; cin >> n;
	for (int i = 1; i <= n; i++) cin >> A[i] >> B[i], P[i] = i;
	sort(P + 1, P + 1 + n, [&](int i, int j) { return A[i] < A[j]; });
	for (int i = 1; i <= n; i++) {
		S[i] = max(S[i - 1] + B[P[i]], 1LL * (B[P[i]] + A[P[i]]));
		DP[i] = max(DP[i - 1], S[i] - A[P[i]]);
	}
	cout << DP[n] << endl;

	return 0;
}

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