Submission #503497

#TimeUsernameProblemLanguageResultExecution timeMemory
503497OrazBArt Exhibition (JOI18_art)C++14
100 / 100
207 ms20840 KiB
#include <bits/stdc++.h> #define N 500005 #define ll long long int #define pii pair <long long, long long> #define pb push_back #define ff first #define ss second using namespace std; ll n, sm, ans = -1e18, mx; pii a[N]; int main () { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i].ff >> a[i].ss; sort(a + 1, a + n + 1); mx = -a[1].ff; for (int i = 1; i <= n; i++){ sm += a[i].ss; ans = max(ans, (sm - a[i].ff) - mx); mx = min(mx, sm - a[i + 1].ff); } 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...