#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
const int INF = 1e9;
const int MAXN = 1e5 + 10;
const int MAXK = 101;
int vetor[MAXN],dp[MAXK][MAXN],N,K,seg[4*MAXN];
void build(int pos,int left,int right){
if(left == right){
seg[pos] = vetor[left];
return;
}
int mid = (left+right)/2;
build(2*pos,left,mid);
build(2*pos+1,mid+1,right);
seg[pos] = max(seg[2*pos],seg[2*pos+1]);
}
int query(int pos,int left,int right,int i,int j){
if(left >= i && right <= j) return seg[pos];
int mid = (left+right)/2;
if(j <= mid) return query(2*pos,left,mid,i,j);
else if(i >= mid + 1) return query(2*pos+1,mid+1,right,i,j);
return max(query(2*pos,left,mid,i,j),query(2*pos+1,mid+1,right,i,j));
}
int main(){
scanf("%d %d",&N,&K);
for(int i = 1;i<=N;i++) scanf("%d",&vetor[i]);
build(1,1,N);
for(int i = 1;i<=N;i++){
dp[1][i] = query(1,1,N,1,i);
}
for(int k = 2;k<=K;k++){
for(int i = k;i<=N;i++){
dp[k][i] = INF;
for(int j = k-1;j<i;j++){
dp[k][i] = min(dp[k][i], dp[k-1][j] + query(1,1,N,j+1,i) );
}
}
}
printf("%d\n",dp[K][N]);
return 0;
}
