This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |