#include<stdio.h>

int n,k,v[16003],min;

inline int nrt(int m)
{
    int s=0,i,nr=0;
    for(i=1;i<=n;++i)
    {
        if(s+v[i]>m)
        {
            s=v[i];
            ++nr;
        }
        else
            s+=v[i];
    }
    ++nr;
    return nr;
}

void caut()
{
    int s,d,m,l;
    s=min;d=2000000000;
    while(s<=d)
    {
        m=(s+d)/2;
        if(nrt(m)<=k)
        {
            l=m;
            d=m-1;
        }
        else
            s=m+1;
    }
    printf("%d\n",l);
}

int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    int i;
    scanf("%d%d",&n,&k);
    v[n]=2100000000;
    for(i=1;i<=n;++i)
    {
        scanf("%d",&v[i]);
        if(v[i]>min)
            min=v[i];
    }

    caut();

    return 0;
}