Submission #950894

#TimeUsernameProblemLanguageResultExecution timeMemory
950894starArt Exhibition (JOI18_art)C++14
100 / 100
131 ms8316 KiB
#include <bits/stdc++.h> using namespace std; #define N 500000 #define LL long long pair<LL,LL> a[N]; LL now=1e9, ans; int n; int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second; sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { a[i].second += a[i-1].second; now = min(now, a[i-1].second - a[i].first); ans = max(ans, a[i].second - a[i].first - now); } cout << ans; 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...