Submission #988300

#	Time	Username	Problem	Language	Result	Execution time	Memory
988300		pemguimn	Potatoes and fertilizers (LMIO19_bulves)	C++14	0 / 100	3 ms	6492 KiB

bulves

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 5e5 + 5, INF = 1e18    + 7;
int n, a[N], b[N], d[N], pre[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 - 1; i++){
        pq.push(pre[i]); pq.push(pre[i]);
        ans = ans + max(0LL, min(pq.top(), pre[n])) - pre[i];
        pq.pop();
    }

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

/*
7
2 0
2 0
2 0
0 5
2 0
2 0
2 0

6
1 2
0 0
2 0
0 0
0 0
0 1

*/

• Subtask 1: 0 / 24
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 36