제출 #241024

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241024		syy	Art Exhibition (JOI18_art)	C++17	0 / 100	5 ms	384 KiB

art

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (ll) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

ll n, ss, ans, best;
pi arr[500005];

int main() {
	fastio; cin >> n;
	FOR(i, 1, n) cin >> arr[i].f >> arr[i].s;
	sort(arr+1, arr+n+1);
	ans = arr[1].s, best = arr[1].f;
	FOR(i, 2, n) {
		ans = max(ans, ss+arr[i-1].s+arr[i].s - arr[i].f + best);
		ss += arr[i-1].s;
		best = max(best, arr[i].f - ss);
	}
	cout << ans;
}

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