#include <stdio.h>
#include <iomanip>
#include <set>
using namespace std;
const int N = 200;
#define pb insert
#define ll long long
#define int long long
#define fr first
#define sc second
#define mk make_pair
ll ans = 2e9;
int n, a[N + 1], k, t[N * 4];
set < pair < int, int > > lr[201];
void bld(int v = 1, int l = 1, int r = n)
{
if(l == r)
{
t[v] = a[l];
return;
}
else
{
int mid = l + r >> 1ll;
bld(v + v, l, mid);
bld(v + v + 1, mid + 1, r);
}
t[v] = max(t[v + v], t[v + v + 1]);
}
void brute(int l, int r, int q)
{
if(q == 1)
{
//printf("%lld %lld %lld\n\n", k - q + 1, l, n);
lr[k - q].pb( mk( l, n ) );
return;
}
if(l == n) return;
else
{
for(int i = r; i <= n - q + 1; i++)
{
//printf("%lld %lld %lld\n", k - q + 1, l, i);
lr[k - q].pb( mk( l, i ) );
brute(i + 1, i + 1, q - 1);
}
}
}
int getmx(int ql, int qr, int v = 1, int l = 1, int r = n)
{
if(l > qr || ql > r) return 0ll;
if(ql <= l && r <= qr)
return t[v];
int mid = l + r >> 1ll;
return max(getmx(ql, qr, v + v, l, mid), getmx(ql, qr, v + v + 1, mid + 1, r));
}
void calc(int cur, int q, ll psum = 0ll/**, int prer = 0**/)
{
if(q == 0)
{
ans = min(ans, psum);
return;
}
else
{
for(pair < int, int > i : lr[cur])
{
/***if(lr[cur][i].fr <= prer);
else***/ calc(cur + 1, q - 1, psum + getmx(i.fr, i.sc)/***, lr[cur][i].sc***/);
}
}
}
main()
{
scanf("%lld %lld", &n, &k);
//scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
//scanf("%d", &a[i]);
bld();
brute(1, 1, k);
calc(0, k);
printf("%lld", ans);
}
/**
5 3
1 2 3 4 5
**/
