C++ :

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 10010;

int n;
int x[N], y[N];

int work(int *q) // *q等价于q[0]
{
    int res = 0;
    sort(q, q + n);
    for(int i = 0; i < n; i++) res += abs(q[i] - q[i / 2]); //下标从0开始 i/2下取整
    return res;
}

int main()
{
    cin >> n;
    for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
    
    sort(x, x + n);
    for(int i = 0; i < n; i++) x[i] -= i;
    
    cout << work(y) + work(x) << endl;
    
    return 0;
}

/*****************
备注：
*****************/
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <queue> 
using namespace std;
#define LL long long
#define MAXM 3010
#define MAXN 3010
const int INF =0x3f3f3f3f;
const int N = 10010;
int n;
int x[N], y[N];
int work(int *q) 
{
    int res = 0;
    sort(q, q + n);
    for(int i = 0; i < n; i++) res += abs(q[i] - q[i / 2]);
    return res;
}
int main()
{
    cin >> n;
    for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
    sort(x, x + n);
    for(int i = 0; i < n; i++) x[i] -= i;
    cout << work(y) + work(x) << endl;
    
    return 0;
}

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 10010;

int n;
int x[N], y[N];

int work(int *q) // *q等价于q[0]
{
    int res = 0;
    sort(q, q + n);
    for(int i = 0; i < n; i++) res += abs(q[i] - q[i / 2]); //下标从0开始 i/2下取整
    return res;
}

int main()
{
    cin >> n;
    for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
    
    sort(x, x + n);
    for(int i = 0; i < n; i++) x[i] -= i;
    
    cout << work(y) + work(x) << endl;
    
    return 0;
}