Submission #707025

#TimeUsernameProblemLanguageResultExecution timeMemory
707025Dan4LifeArt Exhibition (JOI18_art)C++17
100 / 100
547 ms12448 KiB
#include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define int long long #define sz(a) (int)a.size() #define all(a) a.begin(),a.end() const int mxN = (int)5e5+10; int n, m, a[mxN]; pair<int,int> v[mxN]; int32_t main() { cin >> n; int ans = 0; for(int i = 0; i < n; i++) cin >> v[i].fi >> v[i].se, ans = max(ans, v[i].se); sort(v,v+n); int sum = 0; priority_queue<int> pq; for(int i = 0; i < n; i++){ sum+=v[i].se; int cur = sum-v[i].fi; if(sz(pq)) ans = max(ans, cur+pq.top()); pq.push(v[i].se+v[i].fi-sum); } 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...