#include <fstream>
using namespace std;
ifstream fi("transport.in");
ofstream fo("transport.out");
int n,k,a[16002],c;
const int inf =10000000000;

int transport(int c)
{
    int cap=0,tr=0;

    for(int i=1;i<=n+1;i++)
    {  if(a[i] > c and i!=n+1) return inf;
       if(cap+a[i]<=c) {cap+=a[i];}
                 else  {cap=a[i];tr++;}
    }

  return tr;
}
int main()
{
   fi>>n>>k;
   for(int i=1;i<=n;i++) fi>>a[i];
   a[n+1]=inf;

   //while(transport(c)>k) c++;
   //fo<<c<<'\n';


   int sol,st=0,dr=16000*16000+1,mij;

    while(st<=dr)
    {
        mij=(st+dr)/2;

        if(transport(mij)<=k)
        {
            sol=mij;
            dr=mij-1;
        }
        else
            st=mij+1;
    }
  fo<<sol;

    return 0;
}