#include <cstdio>

using namespace std;

const int NMAX=16000;
int n,k,v[NMAX+5];
bool verif(int c)
{
    int i,tr,s;
    tr=s=0;
    for(i=1;i<=n;++i)
    {
        if(v[i]>c)
            return 0;
        if(s+v[i]<=c)
            s+=v[i];
        else
        {
            s=v[i];
            ++tr;
        }
    }
    if(s)
        ++tr;
    return tr<=k;
}
int bs_left(int dr)
{
    int st,med,last;
    st=1;
    while(st<=dr)
    {
        med=st-((st-dr)>>1);
        if(verif(med))
        {
            last=med;
            dr=med-1;
        }
        else
            st=med+1;
    }
    return last;
}
int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    int i,s;
    scanf("%d%d",&n,&k);
    s=0;
    for(i=1;i<=n;++i)
    {
        scanf("%d",&v[i]);
        s+=v[i];
    }
    printf("%d",bs_left(s));
    return 0;
}