Submission #783605

#TimeUsernameProblemLanguageResultExecution timeMemory
783605vjudge1Potatoes and fertilizers (LMIO19_bulves)C++17
100 / 100
152 ms15040 KiB
#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 <long long> 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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...