#include <bits/stdc++.h>

using namespace std;
using pii=pair<int,int>;
const int N=50001;
const int INF=1e9;
pii a[N];
int ix[N];
int dist[N];
//vector <bool> visit(N,false);
int edge[N];

int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;++i){
        scanf("%d%d",&a[i].first,&a[i].second);
        ix[i]=i;
    }
    fill(dist+1,dist+n+1,INF);
    dist[1]=0;
    int sum=0,cnt=0;
    while(true){
        int mindist=INF,u=-1,ui=-1;
        for(int ii=1;ii<=n-cnt;++ii){
            int i=ix[ii];
            if(dist[i]<mindist){
                mindist=dist[i];
                u=i;
                ui=ii;
            }
        }
        if(u==-1) break;
        swap(ix[ui],ix[n-cnt]);
        edge[cnt++]=dist[u];
        sum+=dist[u];
        for(int vv=1;vv<=n-cnt;++vv){
            int v=ix[vv];
            if(abs(a[u].first-a[v].first)+abs(a[u].second-a[v].second)<dist[v]){
                dist[v]=abs(a[u].first-a[v].first)+abs(a[u].second-a[v].second);
            }
        }
    }
    sort(edge,edge+n,greater<int>());
    for(int i=0;i<k-1;++i) sum-=edge[i];
    printf("%d",sum);
    return 0;
}