#include <fstream>

using namespace std;

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

int n,k,i,a[17000],minim,st,dr,mid,maxim,s,t,x;

int main()
{
    fin >> n >> k;
    for (i=1; i<=n; i++)
    {
        fin >> a[i];
        if (a[i] > maxim)
            maxim = a[i];
        s += a[i];
    }
    st = maxim;
    dr = s;
    s = 0;
    while (st <= dr)
    {
        mid = (st+dr)/2;
        x = mid-a[1];
        t = 1;
        for (i=2;i<=n;i++)
            if (x - a[i] >= 0)
                x -= a[i];
            else
            {
                t++;
                x = mid-a[i];
            }
        if (t <= k)
            dr = mid-1;
        else
            st = mid+1;
    }
    fout << st;
    return 0;
}