Submission #1163267

#TimeUsernameProblemLanguageResultExecution timeMemory
1163267boclobanchatArt Exhibition (JOI18_art)C++20
100 / 100
105 ms8264 KiB
#include<bits/stdc++.h>
using namespace std;
#define ii pair<long long,long long>
#define fi first
#define se second
const int MAXN=5e5+5;
ii A[MAXN];
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>A[i].fi>>A[i].se;
	sort(A+1,A+n+1);
	long long ans=0,pref=0,mn=1e18;
	for(int i=1;i<=n;i++)
	{
		mn=min(mn,pref-A[i].fi),pref+=A[i].se;
		ans=max(ans,pref-A[i].fi-mn);
	}
	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...