제출 #1156953

#제출 시각아이디문제언어결과실행 시간메모리
1156953crispxxArt Exhibition (JOI18_art)C++20
100 / 100
323 ms43396 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define nl '\n'

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n; cin >> n;
	
	vector<pair<int, int>> v(n);
	
	for(auto &[a, b] : v) cin >> a >> b;
	
	sort(all(v));
	
	map<int, int> mp;
	
	vector<int> pref(n + 1);
	
	for(int i = 0; i < n; i++) {
		pref[i + 1] = pref[i] + v[i].second;
		mp[pref[i + 1] - v[i].first]++;
	}
	
	int ans = 0;
	
	for(int i = 0; i < n; i++) {
		ans = max(ans, prev(mp.end()) -> first - pref[i] + v[i].first);
		int val = pref[i + 1] - v[i].first;
		if(--mp[val] == 0) mp.erase(val);
	}
	
	cout << ans << nl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...