oj.uz

Submission #1016548

# Submission time Handle Problem Language Result Execution time Memory
1016548 2024-07-08T08:02:26 Z fryingduc Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 2392 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 5e5 + 5;
int n;
pair<long long, int> a[maxn];
long long pref[maxn];

void solve() {
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i].first >> a[i].second;
    }
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; ++i) {
        pref[i] = pref[i - 1] + a[i].second;
    }
    priority_queue<long long, vector<long long>, greater<long long>> pq;
    pq.push(0);
    long long ans = 0;
    for(int i = 1; i <= n; ++i) {
        long long top = pq.top();
        ans = max(ans, pref[i] - a[i].first - top);
        pq.push(pref[i - 1] - a[i].first);
        
    }
    
    cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -