제출 #1256751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1256751		XXBabaProBerkay	Art Exhibition (JOI18_art)	C++20	100 / 100	113 ms	12112 KiB

art

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

#define F first
#define S second
#define MP make_pair
#define PB push_back

using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

template<typename T>
using vec = vector<T>;

template<typename T, int N>
using arr = array<T, N>;

ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }

const int INF = 1e9 + 7;
const int MOD = 998244353;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int N;
	cin >> N;
	vec<pair<ll, ll>> A(N + 1);
	for (int i = 1; i <= N; i++)
		cin >> A[i].F >> A[i].S;

	sort(A.begin() + 1, A.end());

	vec<ll> p(N + 1);
	ll mx = -1e17, ans = 0;
	for (int i = 1; i <= N; i++)
	{
		p[i] = p[i - 1] + A[i].S;
		mx = max(mx, A[i].F - p[i - 1]);
		ans = max(ans, p[i] - A[i].F + mx);
	}

	cout << ans << '\n';
}

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