#include<fstream>
#include<cstring>
#include<cmath>
#define INF 0x7fffffff
#define LL long long
#include<algorithm>
#define MAXN 501
using namespace std;
ifstream fin("marathonb.in");
ofstream fout("marathonb.out");
struct point{LL x,y;};
int N,K;
LL d[MAXN],s[MAXN],F[MAXN][MAXN]; 
point p[MAXN];
LL dis(point a,point b){return abs(a.x-b.x)+abs(a.y-b.y);}
int main()
{
	fin>>N>>K;
	for(int i=1;i<=N;i++) fin>>p[i].x>>p[i].y;
	for(int i=1;i<N;i++) d[i]=dis(p[i],p[i+1]);
	memset(s,0,sizeof(s));
	memset(F,0,sizeof(F));
	s[2]=d[1];
	for(int i=3;i<=N;i++) s[i]=s[i-1]+d[i-1];
	/*DPPPPPPPP*/
	for(int i=2;i<=N;i++) F[i][0]=s[i];
	for(int j=1;j<=K;j++)
	{
		for(int i=j+2;i<=N;i++)
		{
			F[i][j]=-1;
			for(int k=j+1;k<=i-2;k++)
			{
				if(F[i][j]==-1) 
					F[i][j]=F[k][j-1]+s[i]-s[k+2]+dis(p[k],p[k+2]);
				else F[i][j]=min(F[i][j],F[k][j-1]+s[i]-s[k+2]+dis(p[k],p[k+2]));
			}
			for(int k=j+1;k<=i-1;k++) 
			{
				if(F[i][j]==-1) 
					F[i][j]=F[k][j-1]-d[k-1]+dis(p[k-1],p[k+1])+s[i]-s[k+1];
				else F[i][j]=min(F[i][j],F[k][j-1]-d[k-1]+dis(p[k-1],p[k+1])+s[i]-s[k+1]);
			}
		}
	}
	fout<<F[N][K]<<endl;
	return 0;
}