#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
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 = 1e18,N = 3e3+1,MOD = 998244353;
void solve() {
int n,k;
cin >> n >> k;
vi a(n+1);
for (int i=1;i<=n;i++) cin >> a[i];
stack<pii> monostack;
vi dp(n+1,inf),dp2(n+1,inf);
int ans = inf;
int mx = 0;
for (int i=1;i<=n;i++) {
mx = max(mx,a[i]);
dp2[i] = mx;
}
for (int i=1;i<=k;i++) {
if (i > 1) {
for (int j = 1;j<=n;j++) {
while (!monostack.empty() && a[monostack.top().ff] < a[j]) monostack.pop();
int option;
if (!monostack.empty()) option = dp2[monostack.top().ff]+a[j];
else option = a[j]+dp2[i-1];
int mn = option;
if (!monostack.empty()) mn = min(mn,monostack.top().ss);
dp[j] = (j >= i) ? mn : inf;
monostack.push({j,mn});
}
for (int j = 0;j<=n;j++) {
dp2[j] = dp[j];
dp[j] = inf;
}
}
if (i == k) ans = dp2[n];
}
cout << ans << '\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();
}
