Submission #1266889

#TimeUsernameProblemLanguageResultExecution timeMemory
1266889thewizardmanArt Exhibition (JOI18_art)C++20
100 / 100
105 ms8264 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; int n; ll sum, mx; pll a[500000]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i].first >> a[i].second; sort(a, a+n); for (int l = n-1, r = n-1; l >= 0; l--) { if (sum + a[l].first - a[r].first < 0) r = l, sum = 0; sum += a[l].second; mx = max(mx, sum + a[l].first - a[r].first); } cout << mx; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...