Submission #131242

#TimeUsernameProblemLanguageResultExecution timeMemory
131242joylintpArt Exhibition (JOI18_art)C++17
100 / 100
273 ms20984 KiB
#include<bits/stdc++.h>
#define int long long

using namespace std;

pair<int, int> arr[500000];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> arr[i].first >> arr[i].second;
	sort(arr, arr + n);

	int ans = 0, sum = 0, lo = 0;
	for (int i = 0; i < n; i++)
    {
		lo = min(lo, sum - arr[i].first);
		sum += arr[i].second;
		ans = max(ans, sum - arr[i].first - lo);
	}
	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...