#include<bits/stdc++.h>
using namespace std;
using lol=long long int;
#define endl "\n"
const lol mod1=1e9+7,mod2=998244353;
const lol inf=1e18+8;
const double eps=1e-12;
const int N=2*1e5+5;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int _=1;
//cin>>_;
while(_--)
{
int n,k;
cin>>n>>k;
vector<vector<lol> > dp(n,vector<lol>(k+1,inf));
vector<lol> v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
vector<int> psg(n,-1);
stack<lol> st;
for(int i=0;i<n;i++)
{
while(!st.empty() && st.top()<v[i]) st.pop();
if(!st.empty()) psg[i]=st.top();
st.push(i);
}
lol mx=0;
for(int i=0;i<n;i++)
{
mx=max(mx,v[i]);
dp[i][1]=mx;
}
for(int l=2;l<=k;l++)
{
for(int i=0;i<n;i++)
{
lol mx=v[i];
for(int j=i-1;j>=0;j--)
{
dp[i][l]=min(dp[i][l],dp[j][l-1]+mx);
mx=max(v[j],mx);
}
}
}
cout<<dp[n-1][k];
}
return 0;
}
