Submission #3558401

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;

#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;

ll A, B, ans, p, q;
priority_queue<ll> L;
priority_queue<ll,vector<ll>,greater<ll>> R;
ll topL(){return p=L.top()+A;}
ll topR(){return q=R.top()+B;}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;
    cin>>N;
    
    rep(i,N){
        int l,r; cin>>l>>r;
        int len = r-l;
        B+=len;
        L.push(r-A); R.push(r-B);
        while(topL()>topR()){
            ans+=p-q;
            L.pop(); R.pop();
            L.push(q-A); R.push(p-B);
        }
        A-=len;
    }
    cout1(ans);
}

Submission Info

Judge Result