#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define lb lower_bound
#define F first
#define S second
#define sz size()
#define int long long
#define all(v) v.begin(),v.end()
#define FOR1(x, n) for(int j = x; j <= n; j ++)
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N = 3e5+5;
int a[N], b[N], pref[N], dp[N][105], c[N];
int n,m,k,sum=0,x,y, ans, r, cnt, l, mod = 1e9+7;
string s, str;
void solve(){
cin >> n >> m;
FOR(i, 1, n, 1)cin >> a[i];
x = 0;
FOR(i, 1, n, 1){
x = max(x, a[i]);
dp[i][1] = x;
}
set<pair<int, int>>st1;
st1.in({1e18,1e18});
FOR(i, 1, n, 1){
pair<int, int>ko = *st1.lb({ a[i], 0 });
if(ko.F != 1e18)c[i] = ko.S;
st1.in({a[i], i});
}
FOR(i, 1, n,1){
b[i] = 1e18;
FOR(j, 2, m, 1)dp[i][j] = 1e18;
}
b[1] = dp[1][1];
FOR(i, 2, m, 1){
FOR(j, i, n, 1){
if(c[j] == 0)dp[j][i] = b[i-1] + a[j];
else dp[j][i] = dp[c[j]][i];
dp[j][i] = min(dp[j][i], dp[j-1][i-1] + a[j]);
b[i] = min(b[i], dp[j][i]);
}
}
cout << dp[n][m];
}
signed main(){
nikita
int tt = 1;
if(!tt)cin >> tt;
FOR(i, 1, tt, 1)solve();
}
