#include <fstream>
using namespace std;
int n, k, i, v[16001], st, dr, m, s, t, sol;
int main()
{
    ifstream f("transport.in");
    f >> n >> k;
    for (i=0; i<n; ++i)
    {
        f >> v[i];
        if (v[i]>st)
            st = v[i];
        dr+=v[i];
    }
    f.close();
    while (st<=dr)
    {
        m = (st+dr)/2;
        t = 1;
        s = 0;
        for (i=0; i<n; ++i)
            if (s+v[i]<=m)
                s += v[i];
            else
            {
                t++;
                s = v[i];
            }
        if (t <= k)
        {
            sol = m;
            dr = m-1;
        }
        else
            st = m+1;
    }
    ofstream g("transport.out");
    g << sol;
    g.close();
    return 0;
}