Submission #738253

#	Time	Username	Problem	Language	Result	Execution time	Memory
738253		TomkeMonke	Potatoes and fertilizers (LMIO19_bulves)	C++17	100 / 100	181 ms	14972 KiB

bulves

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){
	
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	int n;
	cin >> n;
	
	priority_queue<ll> pq;
	ll ans = 0, pref = 0, x, y;
	
	for(int i = 0; i < n; i++){
		
		pq.push(0);
	}
	
	for(int i = 0; i < n - 1; i++){
		
		cin >> x >> y;
		pref += (x - y);
		
		pq.push(pref);
		
		if(pref < pq.top()){
			
			ans += pq.top() - pref;
			pq.pop(); pq.push(pref);
		}
	}
	
	cin >> x >> y;
	pref += (x - y);
	
	while(pq.size() && pref < pq.top()){
		
		ans += pq.top() - pref;
		pq.pop();
	}
	
	cout << ans << '\n';
	
	return 0;
}

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