#include <cstdio>
using namespace std;
int vol[16001], n, k;
int st = 0, dr = 256000000, s, aux, mid;
int main()
{
    FILE *in, *out;
    in = fopen("transport.in", "r");
    out = fopen("transport.out", "w");
    fscanf(in, "%d", &n);
    fscanf(in, "%d", &k);
    for(int i = 1; i <= n; i++)
    {
        fscanf(in, "%d", &vol[i]);
        if (vol[i] > st)
            st = vol[i]; //maximul dintr volume
    }
    while(st <= dr)
    {
        s = 0;
        aux = 1;
        mid = (st + dr) / 2;
        for(int i = 1; i <= n; i++)
            if (s + vol[i] <= mid)
                s += vol[i];
            else
            {
                s = vol[i];
                aux++;
            }
        if (aux > k)
            st = mid + 1;
        else
            dr = mid - 1;
    }
    fprintf(out, "%d\n", st);
    return 0;
}