Submission #948793

#TimeUsernameProblemLanguageResultExecution timeMemory
948793IrateArt Exhibition (JOI18_art)C++14
100 / 100
176 ms28684 KiB
#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pair<long long, int>>v(n + 1);
    vector<long long>pref(n + 1);
    for(int i = 1;i <= n;++i){
        cin >> v[i].first >> v[i].second;
    }
    sort(v.begin(), v.end());
    for(int i = 1;i <= n;++i){
        pref[i] = pref[i - 1] + v[i].second;
    }
    long long res = 0;
    priority_queue<long long>pq;
    for(int i = 1;i <= n;++i){
        pq.push(v[i].first - pref[i - 1]);
        res = max(res, pq.top() + pref[i] - v[i].first);
    }
    cout << res << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...