#include <cstdio>
using namespace std;
int v[16005];
int transport(int max,int n,int k)
{
    int i,s=0,nrd=1;
    for(i=1;i<=n;i++)
    {
        s+=v[i];
        if(max<s)
        {
            nrd++;
            s=v[i];
        }
        if(v[i]>max)
            return k+1;
    }
   return nrd;
}


int main()
{
    int n,k,max=0,st=0,dr=0;
    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]);
        dr+=v[i];
    }
    st=dr/k;
    int last=0;
    while(st<dr)
    {
        max=(st+dr)/2;
        if(transport(max,n,k)>k)
            st=max+1;
        else{
            dr=max;
            last=dr;
        }
    }
    printf("%d",last);
    return 0;
}