Submission #1231111

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231111		fatassigma_o3o	Art Exhibition (JOI18_art)	C++17	0 / 100	0 ms	320 KiB

art

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define fi first
#define se second

const int N = 5e5+3;

pair<int, int> f[N];
int st[N<<2];

void solve()
{
	f[0]={0,0};

	int n, ans=LLONG_MIN, Max;
	cin>>n;
	for(int i=1; i<=n; i++) cin>>f[i].fi>>f[i].se;
	sort(f+1, f+1+n);
	Max=f[1].fi - f[0].se;
	for(int i=2; i<=n; i++)
	{
		f[i].se += f[i-1].se;						
		ans=max(ans, f[i].se - f[i].fi + Max);
		Max=max(Max, f[i].fi - f[i-1].se);
	}
	cout<<ans;
}

signed main()
{
	fast
	solve();
	return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50