#include <cstdio>
using namespace std;
int v[16005],n,k;
int transport(int x)
{
    int i,s=0,maxm=1;
    for(i=1;i<=n;i++)
    {
        s+=v[i];
        if(s>x)
        {
            maxm++;
            s=v[i];
        }
        if(v[i]>x) return k+1;
    }
   return maxm;
}
int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    int st,dr=0,i,med,last;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        dr+=v[i];
    }
    st=dr/k;
    while(st<dr)
    {
        med=(st+dr)/2;
        if(transport(med)>k)
            st=med+1;
        else{
        dr=med;
        last=dr;
        }
    }
    printf("%d\n",last);
    return 0;
}