#include<iostream>
#include<iomanip>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<string.h>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<cstdio>
#include<bitset>
#include<chrono>
#include<random>
#include<ext/rope>
/* ordered_set
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e5 + 5;
const int maxK = 1e2 + 1;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, k, a[maxN];
int f[maxN][maxK];
void ReadInput()
{
cin >> n >> k;
for(int i=1; i<=n; i++) cin >> a[i];
}
void Solve()
{
memset(f, 3, sizeof f);
f[0][0] = 0;
for(int j=1; j<=k; j++)
{
vector<pair<int, int>> vc;
for(int i=j; i<=n; i++)
{
int _min = f[i - 1][j - 1];
while(!vc.empty() && a[vc.back().fi] <= a[i])
{
_min = min(_min, vc.back().se);
vc.pop_back();
}
if(!vc.empty()) f[i][j] = f[vc.back().fi][j];
f[i][j] = min(f[i][j], _min + a[i]);
vc.pb({i, _min});
}
}
cout << f[n][k];
}
int32_t main()
{
// freopen("x.inp", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
