Submission #106875

#TimeUsernameProblemLanguageResultExecution timeMemory
106875FiloSanzaArt Exhibition (JOI18_art)C++14
0 / 100
2 ms384 KiB
#include <bits/stdc++.h> using namespace std; int main(){ cin.tie(0); cin.sync_with_stdio(0); int N; cin >> N; vector<pair<long long, int>> v(N); for(auto &i : v) cin >> i.first >> i.second; sort(v.begin(), v.end()); long long x, y, sum = 0, ans; for(auto i : v) sum += i.second; ans = sum - (v.back().first - v.front().first); int lo = 0, hi = N-1; while(lo < hi){ x = sum - v[lo].second - (v[hi].first - v[lo+1].first); y = sum - v[hi].second - (v[hi-1].first - v[lo].first); if(x > y){ sum -= v[lo].second; lo++; ans = max(ans, x); } else{ sum -= v[hi].second; hi--; ans = max(ans, y); } } 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...