Submission #1231671

#TimeUsernameProblemLanguageResultExecution timeMemory
1231671antromancapArt Exhibition (JOI18_art)C++20
100 / 100
142 ms8264 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 1;
int n;
pair<long long, int> a[N];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
	sort(a + 1, a + n + 1);
	long long mx = 0, res = 0, pref = 0;
	for (int i = 1; i <= n; i++) {
		mx = max(mx, a[i].first - pref);
		pref += a[i].second;
		res = max(res, pref - a[i].first + mx);
	}
	cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...