#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005;
int n, k;
int niz[mxN];
int dp[mxN][105];
int L[mxN];
int bor[4 * mxN];
void build(int v, int tl, int tr, int id){
if(tl == tr){
bor[v] = dp[tl][id];
return;
}
int mid = (tl + tr) / 2;
build(v * 2, tl, mid, id); build(v * 2 + 1, mid + 1, tr, id);
bor[v] = min(bor[v * 2], bor[v * 2 + 1]);
}
void update(int v, int tl, int tr, int pos, int val){
if(tl == tr){
bor[v] = val;
return;
}
int mid = (tl + tr) / 2;
if(pos <= mid)update(v * 2, tl, mid, pos, val);
else update(v * 2 + 1, mid + 1, tr, pos, val);
bor[v] = min(bor[v * 2], bor[v * 2 + 1]);
}
int kveri(int v, int tl, int tr, int l, int r){
if(tl > r || l > tr)return inf;
if(tl >= l && tr <= r)return bor[v];
int mid = (tl + tr) / 2;
return min(kveri(v * 2, tl, mid, l, r), kveri(v * 2 + 1, mid + 1, tr, l, r));
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k;
ff(i,1,n)cin >> niz[i];
stack<int> stek;
fb(i,n,1){
while(sz(stek) && niz[stek.top()] <= niz[i]){
L[stek.top()] = i + 1; stek.pop();
}
stek.push(i);
}
while(sz(stek)){
L[stek.top()] = 1;
stek.pop();
}
ff(i,0,n)ff(j,0,k)dp[i][j] = inf;
dp[0][0] = 0;
ff(j,1,k){
build(1,0,n,j - 1);
ff(i,1,n){
dp[i][j] = min(dp[i][j], kveri(1,0,n,L[i] - 1,i - 1) + niz[i]);
dp[i][j] = min(dp[i][j], dp[L[i] - 1][j]);
}
}
cout << dp[n][k] << '\n';
return 0;
}
/*
5 1
1 2 3 4 5
5 2
1 2 3 4 5
// probati bojenje sahovski
*/
