제출 #414096

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
414096		Namnamseo	Art Exhibition (JOI18_art)	C++17	100 / 100	241 ms	20964 KiB

art

#include <iostream>
#include <algorithm>
using namespace std;
using ll=long long;
using pli=pair<ll,int>;
const int maxn = int(5e5) + 10;
const ll inf = 1ll<<60;

int n;
pli d[maxn];

int main()
{
	cin.tie(0)->sync_with_stdio(0);

	cin >> n;
	for (int i=1; i<=n; ++i) cin >> d[i].first >> d[i].second;
	sort(d+1, d+n+1);

	ll cp=0, pm=-inf, ans=-inf;
	for (int i=1; i<=n; ++i) {
		cp += d[i].second;
		ans = max(ans, cp + pm - d[i].first);
		ans = max(ans, ll(d[i].second));
		pm = max(pm, d[i].first - (cp - d[i].second));
	}

	cout << ans << '\n';

	return 0;
}

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