#include <bits/stdc++.h>
// created [2019/11/16] 21:52:14
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};

template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename... Args>
auto read(const usize size, Args... args)
{
    std::vector<decltype(read<T>(args...))> ans(size);
    for (usize i = 0; i < size; i++) { ans[i] = read<T>(args...); }
    return ans;
}
template<typename... Types>
auto reads() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#    define SHOW(...) static_cast<void>(0)

template<typename T>
std::vector<T> make_v(const usize size, const T v) { return std::vector<T>(size, v); }
template<typename... Args>
auto make_v(const usize size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }
int main()
{
    const auto n = read<usize>(), K = read<usize>();
    std::vector<ll> H{0};
    for (usize i = 0; i < n; i++) { H.push_back(read<ll>()); }
    if (n == K) { return std::cout << 0 << std::endl, 0; }
    auto h = H;
    std::sort(h.begin(), h.end());
    h.erase(std::unique(h.begin(), h.end()), h.end());
    std::map<ll, usize> zip;
    for (usize i = 0; i < h.size(); i++) { zip[h[i]] = i; }
    SHOW(h);
    const usize s = h.size();
    auto dp       = make_v(n + 1, s, K + 1, inf_v<ll>);
    auto min1     = make_v(n + 1, s, K + 1, inf_v<ll>);  // (k<=j) dp[i][j] - H[j]
    auto min2     = make_v(n + 1, s, K + 1, inf_v<ll>);  // (k>=j) dp[i][j]
    dp[0][0][0] = min2[0][0][0] = 0;
    for (usize j = 0; j < s; j++) { min1[0][j][0] = 0; }
    for (usize i = 1; i <= n; i++) {
        for (usize nj = 0; nj < s; nj++) {  // 次の高さ
            const ll nh = h[nj];
            for (usize k = 0; k <= K; k++) {
                usize nk = k;
                if (nj != zip[H[i]]) {
                    if (k == K) { continue; }
                    nk++;
                }
                const ll Min1 = min1[i - 1][nj][k] + nh;
                const ll Min2 = min2[i - 1][nj][k];
                chmin(dp[i][nj][nk], std::min(Min1, Min2));
            }
        }
        for (usize k = 0; k <= K; k++) {
            for (usize j = 0; j < s; j++) {
                min1[i][j][k] = dp[i][j][k] - h[j];
                min2[i][j][k] = dp[i][j][k];
            }
        }
        for (usize k = 0; k <= K; k++) {
            for (usize j = 1; j < s; j++) {
                chmin(min1[i][j][k], min1[i][j - 1][k]);
            }
        }
        for (usize k = 0; k <= K; k++) {
            for (int j = (int)s - 2; j >= 0; j--) {
                chmin(min2[i][j][k], min2[i][j + 1][k]);
            }
        }
    }
    SHOW(dp);
    ll ans = inf_v<ll>;
    for (usize j = 0; j < s; j++) {
        for (usize k = 0; k <= K; k++) {
            chmin(ans, dp[n][j][k]);
        }
    }
    std::cout << ans << std::endl;
    return 0;
}


Measured memory_bytes: 546688