K BLock - N * K instead of N * K * log

//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e5, K = 1e2;
int dp[N + 1][K + 1], a[N + 1], n, k;
stack<pair<int, int> > St;
void read()
{
    cin >> n >> k;
    for (int i = 1, j = 0; i <= n; ++ i)
    {
        cin >> a[i];
        j = max(j, a[i]);
        dp[i][1] = j;
    }
}
void solve()
{
    for (int j = 2; j <= k; ++ j)
    {
        while(!St.empty())
        {
            St.pop();
        }
        for (int i = j; i <= n; ++ i)
        {
            dp[i][j] = dp[i - 1][j - 1];
            while(!St.empty() && a[i] >= St.top().first)
            {
                //cerr << St.top().first << ' ' << St.top().second << '\n';
                dp[i][j] = min(dp[i][j], St.top().second);
                St.pop();
            }
            if (St.empty() || dp[i][j] + a[i] < St.top().first + St.top().second)
            {
                St.push({a[i], dp[i][j]});
            }
            //cerr << dp[i][j] << ' ';
            dp[i][j] = St.top().first + St.top().second;
        }
    }
    cout << dp[n][k];
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}