Submission #42268

#TimeUsernameProblemLanguageResultExecution timeMemory
42268RezwanArefin01Art Exhibition (JOI18_art)C++14
0 / 100
1 ms248 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> ii; int main(int argc, char const *argv[]) { #ifdef LOCAL_TESTING freopen("in", "r", stdin); #endif int n; cin >> n; vector<ii> p(n); for(int i = 0; i < n; i++) { cin >> p[i].first >> p[i].second; } sort(p.begin(), p.end()); for(int i = 1; i < n; i++) p[i].second += p[i - 1].second; ll cmx = p[0].first, Max = p[0].second; for(int i = 1; i < n; i++) { Max = max(Max, p[i].second - p[i].first + cmx); cmx = max(cmx, p[i].first - p[i - 1].second); } cout << Max << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...