Submission #999676

#TimeUsernameProblemLanguageResultExecution timeMemory
999676IcelastArt Exhibition (JOI18_art)C++17
100 / 100
150 ms24904 KiB
#include <iostream> #include <bits/stdc++.h> #define ll long long using namespace std; const ll maxn = 2*1e5+5, INF = 4e18+9; void solve(){ int n; cin >> n; vector<pair<ll, ll>> a(n+1); for(int i = 1; i <= n; i++){ cin >> a[i].first >> a[i].second; } sort(a.begin()+1, a.end()); ll mx = a[1].first, ans = 0; vector<ll> pf(n+1, 0); for(int i = 1; i <= n; i++){ pf[i] = pf[i-1]+a[i].second; } for(int i = 1; i <= n; i++){ mx = max(mx, a[i].first-pf[i-1]); ans = max(ans, pf[i]-a[i].first + mx); } cout << ans; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...