#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define all(v) (v).begin(),(v).end()
#define F first
#define S second
#define pb push_back
#define popb pop_back
#define ss sort
#define rr reverse
#define pii pair <int, int>
#define pll pair <ll, ll>
using namespace std;
using ld = long double;
using ll = long long;
const int N = 5000+10;
const ll inf = 1e18;
const int Mod = 1e9+7;
const int P = 273;
int n, k, a[N];
ll dp[N][N];
void Erali_is_the_best(int testCase)
{
cin >> n >> k;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
for (int i = 0; i <= n; ++i)
{
for (int j = 0; j <= k; ++j)
{
dp[i][j] = Mod;
}
}
dp[0][0] = 0;
for (int i = 1; i <= n; ++i)
{
for (int x = 1; x <= min(i, k); ++x)
{
dp[i][x] = min(dp[i-1][x-1] + 1, dp[i-1][x] + (a[i] - a[i-1]));
}
}
ll mn = inf;
for (int i = 1; i <= k; ++i)
{
mn = min(mn, dp[n][i]);
}
cout << mn << "\n";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("cardgame.in","r",stdin);
// freopen("cardgame.out","w",stdout);
int tt = 1;
// cin >> tt;
for (int test = 1; test <= tt; ++test)
{
Erali_is_the_best(test);
}
}
