#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int K = 105;
int n, k, dp[N][K], a[N], mx[N][K];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, 1, sizeof dp);
dp[1][1] = a[1];
mx[1][1] = a[1];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= min(k, i); j++) {
int can1 = dp[i - 1][j];
if (mx[i - 1][j] < a[i]) {
can1 = dp[i - 1][j] - mx[i - 1][j] + a[i];
}
int can2 = INT_MAX;
if (j > 1) {
can2 = dp[i - 1][j - 1] + a[i];
}
if (can1 < can2) {
dp[i][j] = can1;
mx[i][j] = max(mx[i - 1][j], a[i]);
}
else {
dp[i][j] = can2;
mx[i][j] = a[i];
}
}
}
cout << dp[n][k] << '\n';
return 0;
}
