#include <iostream>
#include <fstream>

using namespace std;

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

int main()
{
    long long st, dr, n, k, a[16001], piv, sum, p;
    f >> n >> k;
    int x = 0;
    for(int i = 1; i <= n; i++)
    {
        f >> a[i];
        if(a[i] > x) x = a[i];
    }
    st = x;
    dr = 256000001;
    while(st <= dr)
    {
        piv = st + (dr - st) / 2;
        sum = 0;
        p = 1;
        for(int i = 1; i <= n; i++)
        {
            sum += a[i];
            if(sum > piv)
            {
                sum = a[i];
                p++;
            }
        }
        if(p <= k) dr = piv - 1;
        if(p > k) st = piv + 1;
    }
    g << st;
    return 0;
}