#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)
using namespace std;
template<class T1, class T2>
bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2>
bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2>
void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}
template<class T1, class T2>
void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}
template<class T>
void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int N = 1e5 + 10, K = 1e2 + 10;
int n, k;
int a[N];
void input(){
cin >> n >> k;
for(int i=1; i<=n; i++){
cin >> a[i];
}
}
namespace subtask3{
ll f[K][K];
void solve(){
memset(f, 0x3f, sizeof f);
f[0][0] = 0;
for(int i=0; i<k; i++) for(int j=0; j<n; j++) if(f[i][j] < oo){
int ma = 0;
for(int p=j+1; p<=n; p++){
maximize(ma, a[p]);
minimize(f[i + 1][p], f[i][j] + ma);
}
}
cout << f[k][n] << '\n';
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("task.inp", "r", stdin);
// freopen("task.out", "w", stdout);
input();
return subtask3::solve(), 0;
return 0;
}
