#include<bits/stdc++.h>
using namespace std;
int n,k,v[16005],s,ls,ld,m,maxim;
int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        s+=v[i];
        maxim=max(maxim,v[i]);
    }
    ls=maxim;
    ld=s;
    while(ls<ld)
    {
        m=(ls+ld)/2;
        int sum=0;
        int i=0;
        int ture=0;
        while(i<n)
        {
            i++;
            sum+=v[i];
            if (sum>m)
            {
                sum=0;
                ture++;
            }
                else
            if (i==n || (sum+v[i+1])>m)
            {
                sum=0;
                ture++;
            }
        }
        if (ture>k)
        {
            ls=m+1;
        }
            else
        ld=m;
    }
    printf("%d\n",ls);
    return 0;
}