#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int i,n,k,v[16005],dr,st,m,s,nr;
int main()
{
    f>>n>>k;
    for (i=1; i<=n; ++i)
    {
        f>>v[i];
        dr=max(dr,v[i]);
    }
    st=1<<28;
    while(dr<st)
    {
        s=0; nr=1;
        m=(st+dr)/2;
        for (int i=1; i<=n; ++i)
            if (s+v[i]<=m) s+=v[i];
                else s=v[i],++nr;

        if (nr>k) dr=m+1;
            else st=m;
    }
    g<<dr<<"\n";
    return 0;
}