// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

const size_t SIZE = 310;
const ll inf = 5e15;
ll dp[SIZE][SIZE];

int main() {
    ll N, K;
    cin >> N >> K;
    V<ll> H(N);
    for(auto &&ele : H) cin >> ele;
    H.push_back(1e9);
    V<ll> coors;
    {
        coors = H;
        coors.push_back(0);
        coors.push_back(1e9);
        sort(ALL(coors));
        auto ite = unique(ALL(coors));
        coors.erase(ite, coors.end());
    }

    auto get_idx = [&](ll c) {
        return distance(coors.begin(),
                        lower_bound(ALL(coors), c));
    };

    for(ll i = 0; i < coors.size(); i++) {
        if(H[0] == coors[i]) dp[0][i] = coors[i];
        else dp[0][i] = inf;
        for(ll j = 1; j < SIZE; j++) dp[j][i] = coors[i];
    }

    for(ll i = 1; i < N; i++) {
        ll cpy[SIZE][SIZE];
        for(ll j = 0; j < SIZE; j++) for(ll k = 0; k < SIZE; k++) cpy[j][k] = dp[j][k];
        for(ll j = 0; j < SIZE; j++) for(ll k = 0; k < SIZE; k++) dp[j][k] = inf;
        for(ll prek = K; 0 <= prek; prek--) for(ll preh_idx = 0; preh_idx < coors.size(); preh_idx++) {
            // change to pre
            {
                chmin(dp[prek + (coors[preh_idx] != H[i])][preh_idx], cpy[prek][preh_idx]);
            }

            // change to nxt
            {
                ll cost = (H[i + 1] <= coors[preh_idx] ? 0 : H[i + 1] - coors[preh_idx]);
                chmin(dp[prek + (H[i] != H[i + 1])][get_idx(H[i + 1])], cpy[prek][preh_idx] + cost);
            }

            // not change
            {
                ll cost = (H[i] <= coors[preh_idx] ? 0 : H[i] - coors[preh_idx]);
                chmin(dp[prek][get_idx(H[i])], cpy[prek][preh_idx] + cost);
            }
        }
    }

    ll ans = inf;
    for(ll k = 0; k <= K; k++) for(ll h = 0; h < coors.size(); h++) chmin(ans, dp[k][h]);
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 1920