#include<cstdio>
int n,k,i,a[16010],left,right,middle,s,p,sol;
int check()
{
    s=0; p=1;
    for(i=1;i<=n;i++)
    {
        if(a[i]>middle) return 0;
        if(s+a[i]>middle)
        {
            p++;
            s=a[i];
        }
        else
        {
            s+=a[i];
        }
    }
    if(!s) p--;
    return (p<=k);
}
int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    scanf("%d %d",&n,&k);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        right+=a[i];
    }
    while(left<=right)
    {
        middle=(left+right)/2;
        if(check())
        {
            sol=middle;
            right=middle-1;
        }
        else
        {
            left=middle+1;
        }
    }
    printf("%d\n",sol);
    return 0;
}