#include <iostream>
#include <queue>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <math.h>
#include <climits>
#include <stdlib.h>
#include <stdio.h>
#include <iomanip>
#include <assert.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define ub upper_bound
#define lb lower_bound
#define ff first
#define ss second
#define mpr make_pair
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define vpi vector<pii>
#define pb push_back
#define pob pop_back
#define mii map<int,int>
#define vpl vector<pair<ll, ll>>
#define pll pair<ll,ll>
#define all(v) v.begin(),v.end()
#define sz(x) x.size()
#define clr(x) x.clear()
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define print(x) cout<<"x="<<x<<endl;
ll MOD = 1e9 + 7;
ll MOD2 = 998244353;
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setprecision(int x) {
cout.setf(ios::fixed | ios::showpoint);
cout.precision(x);
}
/*void setIO(string name = "") {
if ((int)name.size() > 0) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}*/
ll gcd(ll a, ll b)
{
if(b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
int qannum(int n) {
ll ans = 0;
while (n != 0) {
ans++;
n /= 10;
}
return ans;
}
ll lcm(ll a, ll b) {
return (a * b) / gcd(a, b);
}
ll factorial(ll n) {
ll ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= MOD2;
}
return ans;
}
bool isPrime(int n)
{
if (n <= 1) {
return false;
}
if (n == 2) {
return true;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int sumnum(int n) {
int ans = 0;
while (n != 0) {
ans += n % 10;
n /= 10;
}
return ans;
}
ll bpow_mod(ll a, ll b, ll mod)
{
ll ans = 1;
while (b) {
if ((b & 1) == 1) {
ans *= a;
ans %= mod;
}
b >>= 1;
a *= a;
a %= mod;
}
return ans;
}
bool sortbysec(const pair<int, int>& a,
const pair<int, int>& b)
{
return (a.second < b.second);
}
ll factoriall(ll n, int j) {
ll ans = 1;
for (int i = j; i <= n; i++) {
ans *= i;
ans %= MOD2;
}
return ans;
}
void precalc(){
return;
}
const int N = 1e6+ 10;
ll dp[105][105];
ll a[105];
void solve() {
int n, k;
cin >> n >> k;
ll mx = 0;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= k; ++j){
dp[i][j] = 1e9;
}
}
for(int i = 1; i <= n; ++i){
cin >> a[i];
// mx = max(mx, a[i]);
}
dp[1][1] = a[1];
for(int i = 1; i <= n; ++i){
mx = max(mx, a[i]);
dp[i][1] = mx;
}
for(int k1 = 2; k1 <= k; ++k1){
for(int n1 = k1; n1 <= n; ++n1){
ll st = a[n1];
for(int s = n1 - 1; s >= k1 - 1; s--){
dp[n1][k1] = min(dp[n1][k1], st + dp[s][k1 - 1]);
st = max(st, a[s]);
}
}
}
cout << dp[n][k] << "\n";
}
void cases() {
int t;
cin >> t;
while (t--) {
solve();
}
}
int main() {
//setIo
fastio();
precalc();
//cases();
solve();
return 0;
}
