Submission #397409

#TimeUsernameProblemLanguageResultExecution timeMemory
397409danielcm585Art Exhibition (JOI18_art)C++14
100 / 100
230 ms20856 KiB
#include <bits/stdc++.h> using namespace std; #define a first #define b second typedef long long ll; typedef pair<ll,ll> ii; const int N = 5e5; const ll INF = 1e18; int n; ii v[N+2]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { ll a, b; cin >> a >> b; v[i] = {a,b}; } sort(v+1,v+n+1); for (int i = 2; i <= n; i++) { v[i].b += v[i-1].b; } ll ans = 0, mini = INF; for (int i = 1; i <= n; i++) { mini = min(mini,-v[i].a+v[i-1].b); ans = max(ans,-v[i].a+v[i].b-mini); } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...