#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 5;
const int inf = 0x3f3f3f3f3f3f3f3f;
int a[N],st[4 * N],n,k,dp[N][105];
void build(int id,int l,int r) {
if (l == r) {
st[id] = a[l];
return;
}
int mid = (l + r) / 2;
build(id * 2,l,mid);
build(id * 2 + 1,mid + 1,r);
st[id] = max(st[id * 2],st[id * 2 + 1]);
}
int get(int id,int l,int r,int u,int v) {
if (v < l || r < u) return -inf;
if (u <= l && r <= v) return st[id];
int mid = (l + r) / 2;
return max(get(id * 2,l,mid,u,v),get(id * 2 + 1,mid + 1,r,u,v));
}
void compute(int idx,int l,int r,int optl,int optr) {
if (l > r) return;
int mid = (l + r) / 2;
int best = inf,opt = -1;
for (int i = optl; i <= min(optr,mid); i++) {
int tmp = dp[idx - 1][i - 1] + get(1,1,n,i,mid);
if (tmp < best) best = tmp,opt = i;
}
dp[idx][mid] = best;
compute(idx,l,mid - 1,optl,opt);
compute(idx,mid + 1,r,opt,optr);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
build(1,1,n);
for (int i = 0; i <= k; i++)
for (int j = 0; j <= n; j++) dp[i][j] = inf;
dp[0][0] = 0;
for (int i = 1; i <= n; i++) dp[1][i] = get(1,1,n,1,i);
for (int i = 2; i <= k; i++) compute(i,1,n,1,n);
cout << dp[k][n] << "\n";
}
