Submission #1254765

#TimeUsernameProblemLanguageResultExecution timeMemory
1254765MuhammadSaramArt Exhibition (JOI18_art)C++20
100 / 100
308 ms8232 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long

signed main()
{
	int n;
	cin>>n;
	pair<int,int> a[n];
	for (int i=0;i<n;i++)
		cin>>a[i].first>>a[i].second;
	sort(a,a+n);
	long long ans=0, su=0, mn=-1e18;
	for (int i=0;i<n;i++)
		mn=max(mn,-su+a[i].first), su+=a[i].second, ans=max(ans,su-a[i].first+mn);
	cout<<ans<<endl;

	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...