#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;
    int x = 1;
    for(int i = 1; i <= n; ++i)
    {
        if(s + v[i] > c)
        {
            s = v[i];
            x++;
        }
            else
            {
                s += v[i];
            }
    }
    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 st = maxim, dr = k * maxim, x;
    while(st <= dr)
    {
        int m = (st + dr) / 2;
        if(nrtr(m) <= k)
        {
            x = m;
            dr = m - 1;
        }
            else
            {
                st = m + 1;
            }
    }
    cout << x;
    return 0;
}