제출 #66146

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66146		pamaj	Art Exhibition (JOI18_art)	C++14	100 / 100	313 ms	223932 KiB

art

#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10;
typedef long long ll;

int n;

ll k[maxn], p[maxn];

struct obj
{
	ll val, size;
} it[maxn];

bool compara(obj a, obj b)
{
	if(a.size == b.size) return a.val < b.val;
	return a.size < b.size;
}

int main()
{
	ios::sync_with_stdio(false), cin.tie(nullptr);

	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> it[i].size >> it[i].val;
	}

	sort(it + 1, it + n + 1, compara);

	for(int i = 1; i <= n; i++)
	{
		p[i] = it[i].val + p[i - 1]; 
	}

	k[n] = p[n]-it[n].size;

	for(int i = n-1; i >= 1; i--)
	{
		k[i] = max(k[i + 1], p[i] - it[i].size);
	}


	ll ans = 0;
	for(int i = 1; i < n; i++)
	{
		ans = max(ans, it[i].size - p[i - 1] + k[i]);
	}


	cout << ans << "\n";


	return 0;
}

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