#include <fstream>

using namespace std;

ifstream f("transport.in");
ofstream g("transport.out");
int sol,sum,ok,max1,s,n,a[16005],k;
void bsearch()
{
     int st = max1, dr = s ;
     int mj = 0 ;
      while ( st <= dr )
      {
          mj=(st+dr)/2;
          int ok = 1 ;
          sum=0;
           for ( int i = 1 ; i <= n ; i ++ )
           {
                if(sum+a[i]<=mj)
                sum=sum+a[i];
            else
                {
                ok++;
                sum=a[i];
                 }
           }
           if( k > ok )
            st=mj+1;
           else
           {
               dr=mj-1;
               sol=mj;
           }

      }


}
int main()
{
   f >> n >> k;
    for ( int i = 1 ; i <= n ; i ++ )
    {
         f >> a[i];
          s+=a[i];
          max1=max(a[i],max1);
    }
    bsearch();
    g << sol+1;


    return 0;
}