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