Submission #595489

#TimeUsernameProblemLanguageResultExecution timeMemory
595489BelphegorArt Exhibition (JOI18_art)C++14
100 / 100
191 ms20968 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
pi A[500005];
int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int n; cin>>n;
	for(int i=1; i<=n; i++) cin>>A[i].first>>A[i].second;
	sort(A+1,A+n+1);
	for(int i=2; i<=n; i++) A[i].second+=A[i-1].second;
	ll ans = 0; ll pre = INT64_MIN;
	for(int i=1; i<=n; i++){
		pre = max(pre,-A[i-1].second+A[i].first);
		ans = max(ans,A[i].second-A[i].first+pre);
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...