#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 = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (dp[i + 1][j] > dp[i][j] - mx[i][j] + max(mx[i][j], a[i + 1])) {
dp[i + 1][j] = dp[i][j] + - mx[i][j] + max(mx[i][j], a[i + 1]);
mx[i + 1][j] = max(mx[i][j], a[i + 1]);
}
if (dp[i + 1][j + 1] > dp[i][j] + a[i + 1]) {
dp[i + 1][j + 1] = dp[i][j] + a[i + 1];
mx[i + 1][j + 1] = a[i + 1];
}
}
}
cout << dp[n][k] << endl;
return 0;
}
