Submission #1290544

#TimeUsernameProblemLanguageResultExecution timeMemory
1290544ey00Art Exhibition (JOI18_art)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
	int n;cin>>n;
	vector<pair<int,int>> v(n);
	for(int i=0;i<n;i++)cin>>v[i].first>>v[i].second;
	sort(v.begin(),v.end());
	vector<int> prefs(n);
	prefs[0]=v[0].second;
	for(int i=1;i<n;i++)prefs[i]=prefs[i-1]+v[i].second;
	int mx=LLONG_MIN;
	int mn=-v[0].first;
	for(int i=0;i<n;i++){
		mx=max(mx,(prefs[i]-v[i].first)-mn);
		mn=min(mn,prefs[i]-v[i].first);
	}
	cout<<mx;
	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...