пираты баренцева моря

#include <iostream>
#include <string>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <vector>
#include <set>
#include <iterator>
#include <map>
#include <iomanip>
#define int long long
#define sp system("pause")
#define pb push_back
#define double long double
#define endl "\n"
#define un unsigned
#define INF 1000000000
#define EPS 0.0000001
using namespace std;

int n;

struct point
{
    int x, y;
};

istream& operator >> (istream& in, vector<point>& a)
{
    for (int i = 0; i < n; i++)
    {
        in >> a[i].x >> a[i].y;
    }

    return in;
}

vector <int> vn;

int Binary_search(int l, int r, int key)
{
    int m;

    while (r > l)
    {
        m = (r + l) / 2;

        if (vn[m] >= key)
        {
            r = m;
        }
        else
        {
            l = m + 1;
        }
    }

    if (vn[r] == key || r == 0)
    {
        return r;
    }
    else
    {
        int q = abs(key - vn[r]);
        int w = abs(key - vn[r - 1]);

        if (q < w)
        {
            return r;
        }
        else
        {
            return r - 1;
        }
    }

}


signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie();
    cout.tie();
    cout.precision(15);

    cin >> n;

    vector<point> vc(n);

    cin >> vc;

    int ANS = INF;

    for (int j = 1; j <= n; j++)
    {
        for (int i = 0; i < n; i++)
        {
            vn.pb(i + 1);
        }

        int ans = 0;

        for (int i = 0; i < n; i++)
        {
            int kek1 = Binary_search(0, n - i - 1, vc[i].x);

            ans += abs(vn[kek1] - vc[i].x) + abs(j - vc[i].y);

            vn.erase(vn.begin() + kek1, vn.begin() + kek1 + 1);
        }

        ANS = min(ans, ANS);
    }

    cout << ANS;

    return 0;
}