#include <fstream>

using namespace std;
int v[16001];
int main()
{ int Max,i,n,k,nr,st,dr,Min,mij,sum,s=0;
     ifstream f("transport.in");
     ofstream g("transport.out");
     Max=0;
     f>>n>>k;
     for (i=1;i<=n;++i) {
        f>>v[i];
        Max=max(Max,v[i]);
        s+=v[i];
     }
    st=Max;
    dr=Min=s;
     while (st<=dr) {
        mij=(st+dr)/2;
        nr=1;
        sum=0;
        for (i=1;i<=n;++i)
         if (sum+v[i]>mij) {
            ++nr;
            sum=v[i];
         }
          else sum+=v[i];
        if (nr<=k) {
            Min=min(Min,mij);
            dr=mij-1;
        }
        else st=mij+1;
     }
       g<<Min;
    return 0;
}