#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
ll n, m, a[100005], b[100005], c[100005][18], dp[100005][105];
vector<ll> v;
ll get(ll l, ll r, ll x) {
l = max(l, x);
ll y = __lg(r - l + 1);
return min(c[l][y], c[r - (1 << y) + 1][y]);
}
void kek(ll k) {
for (int i = 0; i <= n + 1; i++) {
for (int j = 0; j <= 17; j++) c[i][j] = (!j ? dp[i][k - 1] : (1LL << 60));
}
for (int i = 1; i <= __lg(n); i++) {
for (int j = 1; j + (1 << i) <= n; j++) {
c[j][i] = min(c[j][i - 1], c[j + (1 << (i - 1))][i - 1]);
}
}
for (int i = 0; i < k; i++) dp[i][k] = (1LL << 60);
for (int i = k; i <= n; i++)
dp[i][k] = min(get(b[i], i - 1, k - 1) + a[i], dp[b[i]][k]);
}
int main() {
speed;
precision;
// code
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
dp[i][1] = max(dp[i - 1][1], a[i]);
while (sz(v) && a[v.back()] < a[i]) v.pop_back();
b[i] = (sz(v) ? v.back() : 0);
v.pb(i);
}
for (int i = 2; i <= m; i++) kek(i);
cout << dp[n][m];
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
