#include <fstream>
#include <climits>

using namespace std;

ifstream in ("transport.in");
ofstream out ("transport.out");

long long v[16001],n,k;

bool verif (long long x)
{
    int last=0,j=k,i;
    for(i=1;i<=n;i++)
    {
        if(v[i]-last>x)
        {
            last=v[i-1];
            j--;
            i--;
        }
        if(j==0)
          return 0;
    }
    return 1;
}

int main()
{
    int x,i;
    long long minim=INT_MAX,dr,st,m;
    in>>n>>k;
    for(i=1;i<=n;i++)
    {
        in>>x;
        v[i]=x+v[i-1];
    }
    st=1;
    dr=16000000;
    while(st<=dr)
    {
        m=(dr+st)/2;
        if(verif(m)!=true)
            st=m+1;
        else
        {
            minim=m;
            dr=m-1;
        }
    }
    out<<minim;
    return 0;
}