Submission #521529

#TimeUsernameProblemLanguageResultExecution timeMemory
521529AdamGSArt Exhibition (JOI18_art)C++17
100 / 100
174 ms20868 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=5e5+7;
pair<ll,ll>T[LIM];
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	rep(i, n) cin >> T[i].st >> T[i].nd;
	sort(T, T+n);
	T[n].st=T[n-1].st;
	ll akt=0, ans=0;
	rep(i, n) {
		ans=max(ans, akt+T[i].nd);
		akt=max(akt+T[i].st+T[i].nd-T[i+1].st, 0ll);
	}
	cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...