#include <fstream>
using namespace std;

ifstream cin("transport.in");
ofstream cout("transport.out");

int v[16002], n, k;

int nrtr(int c)
{
    int s = 0, m, x = 1;
    int st = 1, dr = n;
    while(st <= dr)
    {
        m = (st + dr)/2;
        if(s + v[m] > c)
        {
            st = m + 1;
            s = v[m];
            x++;
        }
            else
            {
                dr = m - 1;
                s += v[m];
            }
    }
    return x;
}

int main()
{
    cin >> n >> k;
    int maxim = 0;
    for(int i = 1;i <= n;++i)
    {
        cin >> v[i];
        if(v[i] > maxim)
        {
            maxim = v[i];
        }
    }
    int c = maxim;
    bool gasit = false;
    while(gasit == false)
    {
        if(nrtr(c) <= k)
        {
            gasit = true;
        }
            else c++;
    }
    cout << c;
    return 0;
}