제출 #410174

#제출 시각아이디문제언어결과실행 시간메모리
410174GurbanArt Exhibition (JOI18_art)C++17
100 / 100
216 ms24772 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn=5e5+5;
int n;
ll mn = -1e18,par[maxn],ans;
pair<ll,ll>p[maxn];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	for(int i = 1;i <= n;i++) cin >> p[i].first >> p[i].second;
	sort(p + 1,p + n + 1);
	
	for(int i = 1;i <= n;i++){
		par[i] = par[i - 1] + p[i].second;
		mn = max(mn,p[i].first - par[i-1]);
		ans = max(ans,par[i] - p[i].first + 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...