#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()

using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

/// find_by_order()
/// order_of_key()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
    return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7; /// think
const ll LINF = 1e18;


const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
    return 0 <= x && 0 <= y && x < n && y < m;
}

template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }

const int N = 311;
ll dp[N][N][2] = {};

main()
{
    ios::sync_with_stdio(0);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    vector <int> a(n);
    for (auto &i : a) cin >> i;
    vector <int> c = a;
    c.pb(0);
    sort(all(c));
    c.erase(unique(all(c)), c.end());
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            dp[i][j][0] = dp[i][j][1] = LINF;
        }
    }
    dp[0][0][0] = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= k; j++) {
            vector <ll> pref(sz(c)), suff(sz(c));
            for (int last = 0; last < sz(c); last++) {
                pref[last] = dp[j][last][0] - c[last];
                if (last) umin(pref[last], pref[last - 1]);
            }
            for (int last = sz(c) - 1; last >= 0; last--) {
                suff[last] = dp[j][last][0];
                if (last + 1 < sz(c)) umin(suff[last], suff[last + 1]);
            }
            for (int cur = 0; cur < sz(c); cur++) {
                umin(dp[j + bool(c[cur] != a[i])][cur][1], min(pref[cur] + c[cur], suff[cur]));
            }
        }
        for (int j = 0; j <= k; j++) {
            for (int last = 0; last < sz(c); last++) {
                dp[j][last][0] = dp[j][last][1];
                dp[j][last][1] = LINF;
            }
        }
    }
    ll ans = LINF;
    for (int i = 0; i <= k; i++) {
        for (int j = 0; j < sz(c); j++) {
            umin(ans, dp[i][j][0]);
        }
    }
    cout << ans << '\n';
}


Measured memory_bytes: 5144