AcWing 123. 士兵（中位數）

傳送門

#include <bits/stdc++.h>

using namespace std;
const int MAXN = 10010;
int X[MAXN], Y[MAXN], N, ans;

int main(){
    //freopen("in", "r", stdin);
    ios::sync_with_stdio(false);
    cin >> N;
    for (int i = 1;i <= N; i++)
        cin >> X[i] >> Y[i];
    sort(X + 1, X + 1 + N);
    sort(Y + 1, Y + 1 + N);
    for (int i = 1;i <= N; i++)
        X[i] -= i;
    sort(X + 1, X + 1 + N);
    for (int i = 1;i <= N; i++)
        ans += abs(X[(N + 1) / 2] - X[i]) + abs(Y[(N + 1) / 2] - Y[i]);
    cout << ans << endl;
    return 0;
}