#include <fstream>

using namespace std;

int v[16001];

int main()
{
    ifstream fin("transport.in");
    ofstream fout("transport.out");
    int n, k, maxx = -1, s = 0, st, dr, mij, tr, sol;
    fin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        fin >> v[i];
        s = s + v[i];
        if (maxx < v[i])
        {
            maxx = v[i];
        }
    }
    st = maxx;
    dr = s;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        s = 0;
        tr = 1;
        for (int i = 1; i <= n; i++)
        {
            if (s + v[i] <= mij)
            {
                s = s + v[i];
            }
            else
            {
                s = v[i];
                tr++;
            }
        }
        if (tr > k)
        {
            st = mij + 1;
        }
        else
        {
            sol = mij;
            dr = mij - 1;
        }
    }
    fout << sol;

    return 0;
}