#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 3e5;
int n, k;
ll a[N];
ll pref[N];
pair<ll, int> dp[N];
void update(pair<ll, int> &a, pair<ll, int> b){
if (a.first < b.first) a = b;
else if (a.first == b.first && a.second > b.second) a = b;
}
pair<ll, int> go(ll lambda){
for(int i = 0; i<=n; ++i) dp[i] = {0, 0};
pair<ll, int> mi = {0, 0};
for(int i = 1; i<=n; ++i){
update(dp[i], dp[i-1]);
update(dp[i], {mi.first + pref[i] - lambda, mi.second + 1});
update(mi, make_pair(dp[i].first - pref[i], dp[i].second));
}
return dp[n];
}
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k;
for(int i= 1; i<=n; ++i) cin >> a[i];
for(int i = 1; i<=n; ++i) pref[i] = pref[i-1] + a[i];
ll l = 0, r = 1e14;
while(l < r){
ll mid = (l + r) >> 1;
if (go(mid).second <= k) r = mid;
else l = mid + 1;
}
pair<ll, int> eww = go(l);
cout << eww.first + k * l << "\n";
return 0;
}
