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