#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define ldb long double
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define fo(i,l,r) for(int i=(l);i<=(r);i++)
#define foi(i,l,r) for(int i=(l);i>=(r);i--)
#define el cout<<'\n';
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define gb(x,i) (((x)>>(i))&1)
#define mask(i) (1LL<<(i))
using namespace std;
const int N=1e5+5;
const int bl=450;
const ll base=1e9+7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll l,ll r)
{
return l+(1ll*rng()*rng()%(r-l+1)+(r-l+1))%(r-l+1);
}
template<class X,class Y>bool maximize(X &a,Y b)
{
if(a<b) return a=b,true;
return false;
}
template<class X,class Y>bool minimize(X &a, Y b)
{
if(a>b) return a=b,true;
return false;
}
void add(ll &a,ll b)
{
a+=b;
if(a>=base) a-=base;
if(a<0) a+=base;
}
int n,k,now,vt;
stack<ii>st;
ll dp[N],g[N],h[N],mn;
int main()
{
//in("o.inp");
//out("bai1.ans");
srand(time(NULL));
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>k;
fo(i,1,n) cin>>h[i];
fo(i,1,n) dp[i]=max(dp[i-1],h[i]);
fo(x,2,k)
{
while(st.size()) st.pop();
fo(i,1,n) g[i]=1e18;
fo(i,x,n)
{
mn=dp[i-1];
while(st.size()&&h[st.top().f]<=h[i]) minimize(mn,st.top().s),st.pop();
if(st.size()) minimize(g[i],st.top().s);
minimize(g[i],mn+h[i]),st.push({i,mn});
}
fo(i,1,n) dp[i]=g[i];
}
cout<<dp[n];
}
