#include <fstream>
using namespace std;

ifstream is("transport.in");
ofstream os("transport.out");

int n,k, a[16001],S, maxim = -99999;

int main()
{
    is >> n >> k;
    for ( int i = 1; i <= n ; ++i )
    {
        is >> a[i];
        if ( a[i] > maxim )
        maxim = a[i];
        S += a[i];
    }
    int p = maxim;
    int u = S;
    while ( p < u)
    {
        int q = 0;
        int c = 1;
        int m = (p+u)/2;
        for ( int i = 1; i <= n; ++i )
        {
            if ( q + a[i] < m )
            q += a[i];
            else
            {
                c++;
                q = a[i];
            }
        }
        if ( c > k )
            p = m+1;
        else
            u = m;
    }
    os << p-1;
    return 0;
}