#include<stdio.h>
#include<cstring>
const int maxn=510;
const int INF=2147483600;
int y[maxn];
int x[maxn];
int f[maxn][maxn];
int n,m;
int min(int x,int y)
{
	if(x>y) return y;
	else return x;
}
int abs(int x)
{
	if(x>0) return x;
	else return -x; 
}
int dis(int i,int j)
{
	return abs(x[i]-x[j])+abs(y[i]-y[j]);
}
int main()
{
	freopen("marathonb.in","r",stdin);
	freopen("marathonb.out","w",stdout);
	scanf("%d%d",&n,&m);
	if(m>n-2) m=n-2;
	for(int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
	memset(f,127/3,sizeof(f));
	f[1][0]=0;	
	for(int i=2;i<=n;i++)
	 for(int j=0;j<=min(i-2,m);j++)
	  for(int k=0;k<=j;k++)
	  {
	  	 f[i][j]=min(f[i-k-1][j-k]+dis(i-k-1,i),f[i][j]);
	  }
	printf("%d\n",f[n][m]);  
}