Submission #636379

#TimeUsernameProblemLanguageResultExecution timeMemory
636379gun_ganArt Exhibition (JOI18_art)C++17
100 / 100
225 ms28976 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { cin.tie(0); ios_base::sync_with_stdio(0); int n; cin >> n; vector<pair<ll,ll>> v(n); for(int i = 0; i < n; i++) cin >> v[i].first >> v[i].second; sort(v.begin(), v.end()); priority_queue<ll> q; vector<ll> dp(n); for(int i = 0; i < n; i++) { dp[i] = max(v[i].first + v[i].second, (q.empty() ? 0 : q.top()) + v[i].second); q.push(dp[i]); } ll mx = 0; for(int i = 0; i < n; i++) { mx = max(mx, dp[i] - v[i].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...