#include <iostream>
#include <stack>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;
using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 100000
int n, k, a[N];
i64 dp[101][N], t[N<<1];
i64 qry(int l, int r)
{
i64 z = 1e18;
for (l += n, r += n + 1; l < r; l >>= 1, r>>=1)
{
if (l&1) z = min(z, t[l++]);
if (r&1) z = min(t[--r], z);
}
return z;
}
int main()
{
memset(dp, 63, sizeof dp);
ShinLena;
cin >> n >> k;
for (int i = 0; i < n; ++i) cin >> a[i];
{
int z = a[0];
for (int i = 0; i < n; ++i) z = max(z, a[i]), dp[0][i] = t[i+n] = z;
for (int i = n; i--;) t[i] = std::min(t[i<<1], t[i<<1|1]);
}
for (int j = 1; j < k; ++j)
{
stack<int> q;
for (int i = 0; i < n; ++i)
{
while (q.size() && a[q.top()] <= a[i]) q.pop();
if (q.size())
{
auto C = min(dp[j][q.top()], dp[j-1][q.top()] + a[i]);
C = min(C, qry(q.top() + 1, i-1) + a[i]);
dp[j][i] = C;
}
else
dp[j][i] = qry(0, i-1) + a[i];
q.push(i);
}
for (int i = 0; i < n; ++i) t[i+n] = dp[j][i];
for (int i = n; i--;) t[i] = std::min(t[i<<1], t[i<<1|1]);
}
cout << dp[k-1][n-1];
return 0;
}
