Submission #1290432

#TimeUsernameProblemLanguageResultExecution timeMemory
1290432dirtblockArt Exhibition (JOI18_art)C++20
100 / 100
438 ms12084 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;

int32_t main() {
	int n; cin>>n;
	vector<pair<int,int>> a(n);
	for(int i=0; i<n; i++) cin>>a[i].first>>a[i].second;
	sort(a.begin(),a.end());
	vector<int> pre(n+1,0);
	for(int i=0; i<n; i++) pre[i+1]=pre[i]+a[i].second;
	int ans=LLONG_MIN,mn=LLONG_MAX;
	for(int i=0; i<n; i++) {
		mn=min(mn,pre[i]-a[i].first);
		ans=max(ans,pre[i+1]-a[i].first-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...