#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
int n, K;
cin >> n >> K;
vector<int> a(n + 1);
for(int i = 1; i <= n; ++i) cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int> (K + 1, 1e18));
dp[0][0] = 0;
for(int k = 1; k <= K; ++k){
for(int i = 1; i <= n; ++i){
for(int j = i, cost = 0; j >= 1; --j){
cost = max(cost, a[j]);
dp[i][k] = min(dp[i][k], dp[j - 1][k - 1] + cost);
if(cost > a[i]){
dp[i][k] = min(dp[i][k], dp[j][k]);
break;
}
}
}
}
cout << dp[n][K] << "\n";
return 0;
}
