#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define file "input"
void setIO() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(file".inp", "r")) {
freopen(file".inp", "r", stdin);
freopen(file".out", "w", stdout);
}
}
const ll INF = 1e18;
const int N = 1e5+5, K = 1e2+2;
int n, k;
ll a[N], prv[N], cur[N], f[N];
int main() {
setIO();
cin >> n >> k;
foru(i, 1, n) {
cin >> a[i];
prv[i] = max(prv[i-1], a[i]);
}
foru(i, 2, k) {
stack<int> st;
memset(f, 0x3f, sizeof(f));
memset(cur, 0x3f, sizeof(cur));
foru(j, 1, n) {
while (!st.empty() && a[st.top()] <= a[j]) {
f[j] = min(f[j], f[st.top()]);
st.pop();
}
if (f[j] < INF) cur[j] = min(cur[j], f[j] + a[j]);
if (!st.empty()) cur[j] = min(cur[j], cur[st.top()]);
st.push(j);
f[j] = min(f[j], prv[j]);
}
foru(j, 1, n) {
prv[j] = cur[j];
}
}
cout << prv[n];
}
