#include <fstream>

using namespace std;

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

int n, k, v[16001], s, maxim = 0, st, dr, mid, livrari, volum, solutie;

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