#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int inf = 1e17,N = 2e6+1,MOD = (1LL<<61)-1,B = 23;
void solve() {
int n,k;
cin >> n >> k;
vi a(n+1);
for (int i=1;i<=n;i++) cin >> a[i];
stack<int> stk;
deque<pii> best[n+1];
best[0].push_back({0,0});
vi active(n+1,0);
active[0] = 1;
vi dp(k+1,inf),mndp(k+1,inf);
dp[0] = mndp[0] = 0;
stk.push(0);
for (int i=1;i<=n;i++) {
while (!stk.empty() && a[stk.top()] <= a[i]) {
active[stk.top()] = 0;
stk.pop();
}
active[i] = 1;
stk.push(i);
for (int j = 0;j<=k;j++) {
while (!best[j].empty() && best[j].back().ss >= dp[j]+a[i]) {
best[j].pop_back();
}
best[j].push_back({i,mndp[j]+a[i]});
}
dp[0] = 0;
for (int j = 1;j<=k;j++) {
while (!best[j-1].empty() && !active[best[j-1].front().ff]) best[j-1].pop_front();
if (best[j-1].empty()) dp[j] = inf;
else dp[j] = best[j-1].front().ss;
}
for (int j = 1;j<=k;j++) {
mndp[j] = min(mndp[j],dp[j]);
}
if (i == n) {
cout << dp[k] << '\n';
}
}
}
int32_t main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Dodi
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
