#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
priority_queue<ll> s;
ll d = 0;
ll ans = 0;
for(int i = 0; i < n; ++i){
int x, y; cin >> x >> y;
d += x - y;
ans += abs(d);
s.push(max(d, 0ll));
s.push(max(d, 0ll));
s.pop();
}
while(s.size()) {
ans -= min(d, s.top());
s.pop();
}
cout << ans << '\n';
}
# | 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... |