# include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 2;
int n, a[N], k, dp[102][N];
int stk[N], pt, pf[N];
int main(){
cin >> n >> k;
for(int i = 1; i <= n; i ++)
cin >> a[i];
for(int i = 1; i <= n; i ++){
dp[1][i] = max(dp[1][i - 1], a[i]);
}
for(int i = 2; i <= k; i ++){
pt = 0;
for(int j = i; j <= n; j ++){
while(pt > 0 && a[ stk[pt] ] < a[j])
pt --;
stk[++ pt] = j;
pf[pt] = dp[i - 1][ max(stk[pt - 1] + 1, i - 1) ] + a[j];
if(pt > 1)
pf[pt] = min(pf[pt - 1], pf[pt]);
dp[i][j] = pf[pt];/*
int mx = 0;
for(int t = j; t >= i; t --){
mx = max(mx, a[t]);
dp[i][j] = min(dp[i][j], dp[i - 1][t - 1] + mx);
}*/
}/*
for(int j = 1; j <= n; j ++){
cout << dp[i][j] << " ";
}
cout << endl;
*/
}
cout << dp[k][n] << endl;
}
