#include <stdio.h>
#include <iomanip>
#include <vector>
using namespace std;
const int N = 200;
#define pb push_back
#define ll long long
#define int long long
#define fr first
#define sc second
#define mk make_pair
ll ans = 1e8;
int n, a[N + 1], k, t[N * 4];
vector < pair < int, int > > lr[201];
void build(int v = 1, int l = 1, int r = n)
{
if(l == r)
{
t[v] = a[l];
return;
}
else
{
int mid = l + r >> 1ll;
build(v + v, l, mid);
build(v + v + 1, mid + 1, r);
}
t[v] = max(t[v + v], t[v + v + 1]);
}
void brute(int l, int q)
{
if(q == k)
{
//printf("%lld %lld %lld\n\n", q, l, n);
lr[q].pb( mk( l, n ) );
return;
}
if(l == n) return;
else
{
for(int i = l; i <= n - q; i++)
{
//printf("%lld %lld %lld\n", q, l, i);
lr[q].pb( mk( l, i ) );
brute(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 0;
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 = 1, ll psum = 0ll, int prel = 0, int prer = 0)
{
if(cur > k)
{
if(ans > psum)
{
ans = psum;
//printf("%lld %lld\n", prel, psum);
}
return;
}
else
{
for(int i = 0; i < lr[cur].size(); i++)
{
int l = lr[cur][i].fr;
if(l <= prer);
else if(l == prer + 1)
{
int r = lr[cur][i].sc;
//printf("CUR %lld %lld %lld\n", cur, l, r);
calc(cur + 1, psum + getmx(l, r), l, r);
}
else return;
}
}
}
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]), sum += a[i];
build( );
brute(1, 1);
calc( );
//puts("");
//printf("%lld\n", getmx(3, 5) + getmx(1, 2));
//puts("");
printf("%lld", ans);
}
/**
5 2
4 5 1 2 3
**/
