#include <fstream>

using namespace std;

int v[16005],n,k,st,dr,mid,suma,maxim,i,start,mx,sfarsit,index;

bool check(int a)
{
    int mx=0,m=1;
    for(int i=1;i<=n;i++)
    {
        if(mx+v[i]<=a)
        {
            mx=mx+v[i];
            continue;
        }
    m++;
    mx=v[i];
    }
    if(m>k)
        return 0;
    return 1;
}

int main()
{
    ifstream f("transport.in");
    ofstream g("transport.out");
    f>>n>>k;
    for(i=1;i<=n;i++)
    {
        f>>v[i];
        suma=suma+v[i];
        if(maxim<v[i])
            maxim=v[i];
    }
    start=maxim-1;
    sfarsit=suma;
    int step=1;
    for(;step<=sfarsit;step<<=1);
    for(;step;step>>=1)
    {
        index=start+step;
        if(index>sfarsit)
        {
            continue;
        }
        if(check(index)==0) start=index;
    }
    g<<start+1;

}