oj.uz

Submission #988243

# Submission time Handle Problem Language Result Execution time Memory
988243 2024-05-24T11:05:30 Z pemguimn Potatoes and fertilizers (LMIO19_bulves) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 2e3 + 5, INF = 1e18    + 7;
int n, a[N], b[N], d[N], pre[N], dp[N][N];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;

    for(int i = 1; i <= n; i++) cin >> a[i] >> b[i], d[i] = a[i] - b[i], pre[i] = pre[i - 1] + d[i];

    priority_queue<int> pq;

    int ans = 0;
    for(int i = 1; i <= n; i++){
        pq.push(pre[i]); pq.push(pre[i]);
        ans += pq.top() - pre[i];
        pq.pop();
    }

    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 24.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 36.0

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