#include <fstream>
using namespace std;
int v[16001];
int n, maxim, suma, i, k, tr, cap, ramas, st, dr;
ifstream fin ("transport.in");
ofstream fout("transport.out");
int main ()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        suma+=v[i];
        if (v[i]>maxim)
            maxim=v[i];
    }
    st = maxim;
    dr = suma;
    while(st<=dr)
    {
        cap =(st+dr)/2;
        tr=1;
        ramas=cap-v[1];
        for(i=2;i<=n;i++)
            if(v[i]<=ramas)
                ramas-=v[i];
            else
            {
                tr++;
                ramas=cap-v[i];
            }
        if(tr<=k)
            dr=cap-1;
        else
            st=cap+1;
    }
    fout<<st;
    return 0;
}