Submission #783604

#	Time	Username	Problem	Language	Result	Execution time	Memory
783604		vjudge1	Potatoes and fertilizers (LMIO19_bulves)	C++17	30 / 100	102 ms	11100 KiB

bulves

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


int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
 
	int n;
    long long ans=0, pref=0, a, b;
    priority_queue <int> pq;
    cin >> n;
	
	for(int i=0; i<n; i++){
        pq.push(0);
    }
	for (int i=0; i<n-1; i++){
        cin >> a >> b;
        pref+=(a-b);
        pq.push(pref);
        if(pref<pq.top()){
            ans+=pq.top()-pref;
            pq.pop();
            pq.push(pref);
        }
	}
	cin >> a >> b;
	pref+=(a-b);
	while(pq.size() && pref<pq.top()){
        ans+=pq.top()-pref;
        pq.pop();
	}
	cout << ans << endl;
}

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