#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define F first
#define S second
const ll N=1e5+5,K=1e2+5,off=(1<<17),INF=1e18;
ll n,k,a[N],nxt[N],dp[N][K];
vector<pii>v;
ll solve(int i,int j){
if(i==n){
if(j==k)return 0;
return INF;
}
if(j==k)return INF;
if(dp[i][j]==-1){
//cout<<i<<' '<<j<<'\n';
dp[i][j]=INF;
dp[i][j]=min(a[i]+solve(i+1,j+1),solve(nxt[i],j));
}
return dp[i][j];
}
int main(){
cin>>n>>k;
for(int i=0;i<n;i++)cin>>a[i];
v.push_back({n,INF});
for(int i=n-1;i>=0;i--){
while(!v.empty() and v.back().S<a[i])v.pop_back();
//cout<<"----------------\n";
//for(int j=0;j<v.size();j++)cout<<v[j].F<<' '<<v[j].S<<'\n';
nxt[i]=v.back().F;
v.push_back({i,a[i]});
}
//for(int i=0;i<n;i++)cout<<nxt[i]<<' ';
//cout<<'\n';
for(int i=0;i<N;i++)for(int j=0;j<K;j++)dp[i][j]=-1;
cout<<solve(0,0);
return 0;
}
