#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
const int MX = 100001;
const int MOD = (int) (1e9 + 7);
const int INF = 987654321;
namespace output {
void pr(int x) {
cout << x;
}
void pr(long x) {
cout << x;
}
void pr(ll x) {
cout << x;
}
void pr(unsigned x) {
cout << x;
}
void pr(unsigned long x) {
cout << x;
}
void pr(unsigned long long x) {
cout << x;
}
void pr(float x) {
cout << x;
}
void pr(double x) {
cout << x;
}
void pr(long double x) {
cout << x;
}
void pr(char x) {
cout << x;
}
void pr(const char * x) {
cout << x;
}
void pr(const string & x) {
cout << x;
}
void pr(bool x) {
pr(x ? "true" : "false");
}
template < class T1, class T2 > void pr(const pair < T1, T2 > & x);
template < class T > void pr(const T & x);
template < class T, class...Ts > void pr(const T & t,
const Ts & ...ts) {
pr(t);
pr(ts...);
}
template < class T1, class T2 > void pr(const pair < T1, T2 > & x) {
pr("{", x.f, ", ", x.s, "}");
}
template < class T > void pr(const T & x) {
pr("{"); // const iterator needed for vector<bool>
bool fst = 1;
for (const auto & a: x) pr(!fst ? ", " : "", a), fst = 0;
pr("}");
}
void ps() {
pr("\n");
} // print w/ spaces
template < class T, class...Ts > void ps(const T & t,
const Ts & ...ts) {
pr(t);
if (sizeof...(ts)) pr(" ");
ps(ts...);
}
void pc() {
cout << "]" << endl;
} // debug w/ commas
template < class T, class...Ts > void pc(const T & t,
const Ts & ...ts) {
pr(t);
if (sizeof...(ts)) pr(", ");
pc(ts...);
}
#define dbg(x...) pr("[", #x, "] = ["), pc(x);
}
#ifndef ONLINE_JUDGE
using namespace output;
#else
using namespace output;
#define dbg(x...)
#endif
int dp[MX][101];
int n;
struct Node {
int val;
};
int t[4 * MX];
void upd(int p, int v) {
for (t[p += (n + 1)] = v; p > 1; p >>= 1) t[p >> 1] = min(t[p], t[p^1]);
}
int query(int l, int r) {
int res = INF;
for (l += (n + 1), r += (n + 1); l < r; l >>= 1, r >>= 1) {
if (l&1) res = min(res, t[l++]);
if (r&1) res = min(res, t[--r]);
}
return res;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int k; cin >> n >> k;
vi a(n + 1), lft(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
stack<pi> stk;
for (int i = 1; i <= n; i++) {
while (!stk.empty() && stk.top().f <= a[i]) {
stk.pop();
}
lft[i] = (stk.empty() ? 0 : stk.top().s);
stk.push(mp(a[i], i));
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= k; j++) {
dp[i][j] = INF;
}
}
dp[0][0] = 0;
for (int j = 0; j <= k; j++) {
for (int i = 1; i <= n; i++) {
if (lft[i] != 0) dp[i][j] = min(dp[i][j], dp[lft[i]][j]);
if (j) {
dp[i][j] = min(dp[i][j], query(lft[i], i) + a[i]);
}
}
for (int i = 0; i <= n; i++) {
upd(i, dp[i][j]);
}
}
cout << dp[n][k] << '\n';
}
