#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================

auto solve(ll n, ll k, const VL& v) {
	if (k == n) { return 0LL; }
	VVL dp(n, VL(n - k + 1, 0LL));
	REP(i, n) { dp[i][1] = v[i]; }

	REP(i, n) FOR(j, 2, n - k + 1) {
		ll val = 1e16;
		REP(t, i) {
			ll dif = std::max(0LL, v[i] - v[t]);
			chmin(val, dp[t][j - 1] + dif);
		}
		dp[i][j] = val;
	}
	ll ans = 1e16;
	REPC(y, dp) { chmin(ans, y[n - k]); }
	return ans;
}


auto solve_c(ll n, ll k, const VL& v) {
	if (k == n) { return 0LL; }
	ll ans = 1e16;
	ll p = n - k;
	REP(i, (1 << n)) {
		VL t; t.reserve(n);
		REP(j, n)if ((i >> j) & 1) { t.emplace_back(j); }
		if (p != t.size()) { continue; }
		ll tmp = v[t[0]];
		FOR(j, 1, p) {
			tmp += std::max(0LL, v[t[j]] - v[t[j - 1]]);
		}
		chmin(ans, tmp);
	}
	return ans;
}

signed main() {
	/**/
	ll n, k;
	cin >> n >> k;
	VL v(n);
	cin >> v;

	auto ans = solve(n, k, v);
	cout << ans << endl;
	/*/
	auto gen = Sample::SampleGenerator(0);
	REP(_, 1000) {
		auto [n] = gen.generate(PAIR{5,10});
		auto [k] = gen.generate(PAIR{0,n});
		auto [v] = gen.generate(V<PAIR>(n, PAIR{1,10}));
		
		auto ans = solve(n, k, v);
		auto ans_c = solve_c(n, k, v);
		if (ans != ans_c) {
			cout << n << " " << k << endl;
			REPC(x, v) { cout << x << " "; }
			BR();
			dump(ans, ans_c);
			return 0;
		}
	}
	/**/
}


Measured memory_bytes: 1024