#include <fstream>

using namespace std;

ifstream in ("transport.in");
ofstream out ("transport.out");

const int max_size = 16e3 + 1, INF = 1e9 + 1;

int v[max_size];

int main ()
{
    int n, k, mx = 0;
    in >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        in >> v[i];
        mx = max(mx, v[i]);
    }
    int st = mx, dr = INF, ans = INF;
    while (st <= dr)
    {
        int m = (st + dr) / 2;
        int ct = 1; /// ne indica de cate transporturi am avut nevoie inainte
        int curr = 0; /// volumul din transportul curent
        for (int i = 1; i <= n; i++)
        {
            if (curr + v[i] > m)
            {
                ct++;
                curr = 0;
            }
            curr += v[i];
        }
        if (ct <= k)
        {
            ans = m;
            dr = m - 1;
        }
        else
        {
            st = m + 1;
        }
    }
    out << ans;
    in.close();
    out.close();
    return 0;
}