/*
author: assanali
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
can do: find_by_order, order_of_key
__builtin_clz(x): the number of zeros at the beginning of the number
__builtin_ctz(x): the number of zeros at the end of the number
__builtin_popcount(x): the number of ones in the number
__builtin_parity(x): the parity (even or odd) of the number of ones
mt19937 rng(17);
mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());
*/
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define lv v+v
#define rv v+v+1
#define files freopen("a.txt", "r", stdin), freopen("a.txt", "w", stdout)
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair <long long, long long>;
using pii = pair <int,int>;
using pld = pair <long double, long double>;
using ull = unsigned long long;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
long long mod = 1e9 + 7;
const ll N = 3e5 + 10;
const ll M = 1e6 + 10;
const ll P = 317;
const ld EPS = 1e-7;
const ll block = 450;
const ll inf = 1e18;
ll n,k,dp[N],a[N],tmp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll _ = 1; //cin>>_;
while(_--) {
cin>>n>>k;
for(ll i = 1; i<=n; i++) {
cin>>a[i];
dp[i] = max(dp[i-1], a[i]);
}
for(ll c = 2; c<=k; c++) {
stack <pll> st;
for(ll i = c; i <= n; i++) {
ll cur = dp[i-1];
while(!st.empty()) {
if((st.top()).F <= a[i]) {
cur = min(cur, (st.top()).S - (st.top()).F);
st.pop();
}
else {
break;
}
}
if(st.empty()) {
st.push({a[i], cur + a[i]});
}
else {
st.push({a[i], min(cur + a[i], (st.top()).S)});
}
tmp[i] = (st.top()).S;
}
for(ll i = c; i<=n; i++) {
dp[i] = tmp[i];
}
}
cout<<dp[n];
}
return 0;
}
// equal, min, max, 1, random, build
/*
*/
