제출 #1062428

#제출 시각아이디문제언어결과실행 시간메모리
1062428ducksaysquackArt Exhibition (JOI18_art)C++98
100 / 100
395 ms24916 KiB
#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
signed main() {
	int n; cin >> n;
	vector<pair<int,int>> v(n+1); for(int i=0;i<n;i++) cin >> v[i].f >> v[i].s;
	sort(begin(v),end(v));
	for(int i=0;i<n;i++) v[i+1].s += v[i].s;
	vector<int> w(n); w[0] = v[1].f-v[0].s;
	for(int i=1;i<n;i++) w[i] = max(w[i-1],v[i+1].f-v[i].s);
	int ans = 0; for(int i=1;i<=n;i++) ans = max(ans, w[i-1]+v[i].s-v[i].f);
	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...