Submission #772937

#TimeUsernameProblemLanguageResultExecution timeMemory
772937LecorbioPotatoes and fertilizers (LMIO19_bulves)C++14
30 / 100
103 ms4556 KiB
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
typedef long long ll;

priority_queue <int> q;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n; cin >> n;
	ll ans=0, pref=0, a, b;

	for (int i=0; i<n; i++) q.push(0);
	for (int i=0; i<n-1; i++){
        cin >> a >> b;
        pref += (a-b);

        q.push(pref);
        if (pref < q.top()){
            ans += (q.top() - pref);
            q.pop();
            q.push(pref);
        }
	}

	cin >> a >> b;
	pref += (a-b);
	while (q.size() && pref < q.top()){
        ans += (q.top() - pref);
        q.pop();
	}
	cout << ans << '\n';
	return 0;
}
#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...