#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,K,a[21],dp[21][21][21][21],ans=1e18,A,B;
signed main(){
	cin>>n>>K;
	for(int i=1;i<=n;i++)cin>>a[i];
	memset(dp,0x3f,sizeof(dp));
	dp[0][0][0][0]=0;
	for(int i=1;i<=n;i++)for(int j=0;j<=K;j++)
	for(int l=1;l<=n;l++)for(int k=0;k<=n;k++){
		if(a[l]+k>=a[i])for(int tl=0;tl<=n;tl++)
		for(int tk=0;tk<=n;tk++){
			A=a[tl]+tk,B=a[l]+k;
			if(A<B&&!j)continue;
			if(A<B)dp[i][j][l][k]=min(dp[i][j][l][k],dp[i-1][j-1][tl][tk]+a[l]+k-a[i]);
			else dp[i][j][tl][tk]=min(dp[i][j][tl][tk],dp[i-1][j][tl][tk]);	
		}
		if(i==n&&j==K)ans=min(ans,dp[i][j][l][k]);
	}
	cout<<ans;						
	return 0;
}