#include<iostream>
#include<fstream>
using namespace std;
int i, s, v[1000], rezultat, k, n, step, rez;
bool drive(int loc)
{
    int i=1, rasp=1, s=0;
    while(i<=n)
    {
        if(s+v[i]>loc)
        {
            rasp++;
            s= v[i];
        }
        else s+=v[i];
        i++;
    }
    if(rasp>k)
    {
        return 0;
    }
    return 1;
}
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];
    }
    for(step=1;step<s;step<<=1);
    for(rez=0; step;step>>=1)
    {
        if(rez+step<=s && drive(rez+step)!=1 )
        {
            rez+=step;
        }
    }
    cout<< ++rez;
    /*int st=1, dr=s;
    int mij = (st+dr)/2;

    while(st<dr)
    {
       if( drive(mij) == 1)
       {
           rezultat= mij;
           dr=mij-1;
       }
       else st= mij+1;
       mij= (st+dr)/2;
    }*/
   // printf("%d", rezultat);
}