#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,i,j,a[16005],s,st,dr,mid,ultimul,sol,drumuri,vmax,vtotal,v,raspuns;
int main()
{
    fin>>n>>k;
    //fout<<k<<"\n";
    for(i=1; i<=n; i++)
    {
        fin>>a[i];
        if(a[i]>vmax)vmax=a[i];
        vtotal+=a[i];
    }
    st=vmax;
    dr=vtotal;
    while(st<=dr)
    {
        mid=(st+dr)/2;
        //fout<<"mid= "<<mid<<"\n";//,drumuri= "<<drumuri<<"\n";

        v=0;
        i=1;
        drumuri=1;
        while(i<=n)
        {
            //fout<<"a[i]="<<a[i]<<"\n";
            //fout<<"v="<<v<<" apoi ";
            if(v+a[i]<=mid)
                    v+=a[i];
            else
            {
                v=a[i];
                drumuri++;
            }//fout<<"v="<<v<<"\n";
            //fout<<"drumuri="<<drumuri<<"\n";
            i++;
        }
       // fout<<"drumuri:"<<drumuri<<"\n";
        if(drumuri>k)
            st=mid+1;
        else if(drumuri<=k)
            {dr=mid-1;raspuns=mid;}

    }
    fout<<raspuns;
    return 0;
}