#include<bits/stdc++.h>
#define forin(i,a,b) for(int i=a;i<=b;++i)
#define forde(i,a,b) for(int i=a;i>=b;--i)
#define ll long long
using namespace std;
const int N = 5e3 + 10;
int n, k;
ll a[N], dp[N][N], sp[N][17];
void build() {
forin(i,1,n) sp[i][0] = a[i];
forin(j,1,log2(n)) forin(i,1,n - (1<<j) + 1) {
sp[i][j] = max(sp[i][j - 1], sp[i + (1<<(j - 1))][j - 1]);
}
}
ll cost(int f, int l) {
if(f > l) return 1e16;
int j = (int)log2(l - f + 1);
return max(sp[f][j], sp[l - (1<<j) + 1][j]);
}
int main () {
cin.tie(0)->sync_with_stdio(0);
if(fopen("Task.inp","r")) {
freopen("Task.inp","r",stdin);
freopen("AC.out","w",stdout);
}
cin>>n>>k;
forin(i,1,n) cin>>a[i];
build();
memset(dp, 127, sizeof(dp));
dp[0][0] = 0;
forin(o,1,k) forin(i,1,n) {
ll &a = dp[i][o];
forin(j,0,i - 1) {
a = min(a, dp[j][o - 1] + cost(j + 1, i));
}
}
cout<<dp[n][k];
}
