713C - Sonya and Problem Wihtout a Legend - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

int n, x;
long long miny = 0;
priority_queue<int> l;

int main() {
    cin >> n;
    for(int i=0;i<n;i++) {
        cin >> x; x-=i;
        if(l.empty()) {
            l.push(x);
        } else {
            if(x <= l.top()) { //x is between l and r
                miny += l.top()-x;
                l.push(x); l.push(x); l.pop();
            } else {
                l.push(x);
            }
        }
    }
    cout << miny;
}