Submission #410202

#TimeUsernameProblemLanguageResultExecution timeMemory
410202ngpin04Art Exhibition (JOI18_art)C++14
100 / 100
238 ms9460 KiB
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = 5e5 + 5; 

pair <long long, long long> a[N];

int n;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) 
		cin >> a[i].fi >> a[i].se;

	sort(a + 1, a + n + 1);

	long long mn = 1e18;
	long long ans = -1e18;
	for (int i = 1; i <= n; i++) {
		a[i].se += a[i - 1].se;
		mn = min(mn, a[i - 1].se - a[i].fi);
		ans = max(ans, a[i].se - a[i].fi - mn);
	}
	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...