#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    ifstream f("transport.in");
    ofstream g("transport.out");
    int n, i, k, v[16001], maxim = 0, suma = 0;
    f>>n>>k;
    for(i=0; i<n; i++)
    {
        f>>v[i];
        if(v[i] > maxim)
            maxim = v[i];
        suma += v[i];
    }
    int s, st = maxim, dr = suma, m, nr, rez = 16001;
    while(st <= dr)
    {
        m = (st + dr) / 2;
        s = 0;
        nr = 0;
        for(i=0; i<n; i++)
        {
            s += v[i];
            if(s > m)
            {
                nr++;
                s = v[i];
            }
        }
        if(s != 0)
            nr++;
        if(nr <= k)
        {
            dr = m - 1;
            if(m < rez)
                rez = m;
        }
        else
            st = m + 1;
    }
    g<<rez;
    return 0;
}