#include <fstream>

using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[16005],s,maxim,st,dr,mij,cap,t,sol;
int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
        s+=v[i];
        if(v[i]>maxim)
        {
            maxim=v[i];
        }
    }
    st=maxim;
    dr=s;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        cap=v[1];
        t=1;
        for(int i=2;i<=n;i++)
        {
            if(cap+v[i]>mij)
            {
                t++;
                cap=v[i];
            }
            else{
              cap+=v[i];
            }
        }
        if(t<=k)
        {
            sol=mij;
            dr=mij-1;
        }
        else{
            st=mij+1;
        }
    }
    fout<<sol;
    return 0;
}