#include <fstream>
#include <iostream>

using namespace std;

int main()
{
    int n, k, sir[16001], maxim = 0, st, dr, mij, ck, sum, ver, sol;
    long long sirSum = 0;
    ifstream file_in ("transport.in");
    ofstream file_out ("transport.out");
    file_in >> n >> k;

    for (int i = 0; i < n; i++) {
        file_in >> sir[i];
        sirSum += sir[i];
        if(sir[i] > maxim)
            maxim = sir[i];
    }
    st = maxim;
    dr = sirSum;
    while(st<=dr)
    {
        ck = 0;
        mij = (st + dr)/ 2;
        sum = 0;
        for(int i = 0; i < n; i++)
        {
            sum += sir[i];
            ver = 0;
            if(sum > mij)
            {
                sum = 0;
                ck++;
                ver = 1;
                i--;
            }
        }
        if(ver == 0)
            ck++;
        if(ck <= k)
        {
            sol = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    file_out << sol;

    return 0;
}