#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
#define ll long long
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define pll pair<ll, ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
ll n, m, a[100005], pv;
ll dp[105][100005];
vector<pll> v;
pll tmp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
iloop(0, n) cin >> a[i];
iloop(0, m+1) jloop(0, n+1) dp[i][j] = INF;
dp[0][0] = 0;
iloop(1, m+1) {
v.push_back({0, dp[i-1][0]});
jloop(1, n+1) {
while (v.size() && v.back().first != 0 && a[v.back().first-1] <= a[j-1]) {
tmp = v.back();
v.pop_back();
v.back().second = min(v.back().second, tmp.second);
}
dp[i][j] = min(v.back().second + a[j-1], dp[i][v.back().first]);
v.push_back({j, dp[i-1][j]});
}
v.clear();
}
cout << dp[m][n] << "\n";
}
