Submission #364507

#TimeUsernameProblemLanguageResultExecution timeMemory
364507NachoLibreArt Exhibition (JOI18_art)C++17
100 / 100
263 ms20972 KiB
#include <bits/stdc++.h> using namespace std; const int N = 500005; int n; pair<long long, long long> a[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 0; i < n; ++i) { cin >> a[i].first >> a[i].second; } sort(a, a + n); long long x = a[0].first, fp = a[0].second; for(int i = 1; i < n; ++i) { a[i].second += a[i - 1].second; x = max(x, a[i].first - a[i - 1].second); fp = max(fp, a[i].second - a[i].first + x); } cout << fp << endl; 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...