제출 #1203762

#제출 시각아이디문제언어결과실행 시간메모리
1203762chawinknArt Exhibition (JOI18_art)C++20
100 / 100
116 ms12112 KiB
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define ll long long

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int n;
	cin >> n;
	vector<pair<ll,ll>> a(n);
	for (auto& [A,B] : a)
		cin >> A >> B;
	sort(a.begin(), a.end());
	vector<ll> qs(n+1);
	for (int i = 1; i <= n; i++)
		qs[i] = qs[i-1]+a[i-1].s;
	ll mx=0, ans=0;
	for (int i = 1; i <= n; i++)
		mx = max(mx, -qs[i-1]+a[i-1].f), ans = max(ans, qs[i]-a[i-1].f+mx);
	cout << ans;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...