Submission #411666

#TimeUsernameProblemLanguageResultExecution timeMemory
411666nichkeArt Exhibition (JOI18_art)C++14
100 / 100
251 ms24828 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

int n;
int dp[500005];
pair<int, int> ar[500005];

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> ar[i].first >> ar[i].second;
	}
	sort(ar, ar + n);
	dp[0] = ar[0].second;
	for (int i = 1; i < n; i++) {
		dp[i] = max(ar[i].second, dp[i - 1] - ar[i].first + ar[i - 1].first + ar[i].second);
	}
	int ans = 0;
	for (int i = 0; i < n; i++) {
		ans = max(ans, dp[i]);
	}
	cout << ans << '\n';
	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...