#include <bits/stdc++.h>

using namespace std;


using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N, K;
  cin >> N >> K;
  vector< int > H(N);
  cin >> H;
  H.emplace_back(0);
  ++N;

  vector< int > xs(H);
  xs.emplace_back(0);
  sort(begin(xs), end(xs));
  xs.erase(unique(begin(xs), end(xs)), end(xs));
  for(int i = 0; i < N; i++) {
    H[i] = lower_bound(begin(xs), end(xs), H[i]) - begin(xs);
  }


  auto dp2 = make_v< int64 >(xs.size(), K + 1);
  fill_v(dp2, infll);
  for(int i = 0; i < xs.size(); i++) dp2[i][i != H[0]] = xs[i];

  for(int i = 1; i < N; i++) {

    auto dp3 = make_v< int64 >(xs.size(), K + 2);
    fill_v(dp3, infll);

    for(int k = 0; k <= K; k++) {

      auto dp4 = make_v< int64 >(xs.size());
      fill_v(dp4, infll);
      {
        int64 tap = infll;
        for(int j = (int) xs.size() - 1; j >= 0; j--) {
          chmin(tap, dp2[j][k] + xs[j]);
          chmin(dp4[j], tap);
        }
      }

      auto dp5 = make_v< int64 >(xs.size());
      fill_v(dp5, infll);
      {
        int64 tap = infll;
        for(int j = 0; j < xs.size(); j++) {
          chmin(tap, dp2[j][k] - xs[j]);
          chmin(dp5[j], tap);
        }
      }




      // dp2[*][k]についてj方向にうくを構築
      for(int l = 0; l < xs.size(); l++) {

        chmin(dp3[l][k + (H[i] != l)], dp5[l] + xs[l]);
        chmin(dp3[l][k + (H[i] != l)], dp4[l] - xs[l]);

        // dp2[j][k]+abs(xs[j]-xs[l])
        // 0≦j<xs.size()
        // xs[j]<xs[l]:= dp2[j][k]+xs[l]-xs[j]
        // xs[j]>=xs[l]:= dp2[j][k]+xs[j]-xs[l]
/*

        for(int j = 0; j < l; j++) {
          chmin(dp3[l][k + (H[i] != l)], dp2[j][k] + xs[l] - xs[j]);
        }

        for(int j = l; j < xs.size(); j++) {
          chmin(dp3[l][k + (H[i] != l)], dp2[j][k] + xs[j] - xs[l]);
        }
*/
      }
    }
    dp2.swap(dp3);
  }


  int64 ret = infll;
  for(int i = 0; i <= K; i++) chmin(ret, dp2[0][i]);
  cout << ret / 2 << endl;
}





Measured memory_bytes: 1664