#include <iostream>
#include <fstream>

using namespace std;

ifstream f("transport.in");
ofstream g("transport.out");

int n, k, a[16001], suma, maxim, sol;

bool verificare (int x)
{
    int s = 0, t = 0;
    for (int i = 1; i <= n; ++i)
    {
        if (s + a[i] > x)
        {
            s = a[i];
            t++;
            if (t > k)
                return 0;
        }
        else
            s += a[i];
    }
    if (t >= k)
        return 0;
    return 1;
}

int main()
{
    f>>n>>k;
    for (int i = 1; i <= n; ++i)
    {
        f>>a[i];
        suma += a[i];
        if (a[i] > maxim)
            maxim = a[i];
    }
    int st = maxim, dr = suma;
    while (st <= dr)
    {
        int mid = (st + dr) / 2;
        if (verificare(mid))
        {
            sol = mid;
            dr = mid - 1;
        }
        else
            st = mid + 1;
    }
    g<<sol;
    f.close();
    g.close();
    return 0;
}