#include <fstream>

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