#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");

long long Right,Left,mid,sol,n,k,i,Max,a[16005];
void Read()
{
    fin>>n>>k;
   for(i=1;i<=n;i++)
        {
            fin>>a[i];
            if(a[i]>Max)
                Max=a[i];
        }
}
int nrtrans(int x)
{
   int c=1,s1=0;
    for(i=1;i<=n;i++)
    {
        if((a[i]+s1)<=x)
            s1+=a[i];
        else
        {
            c++;
            s1=a[i];
        }
    }
    return c;
}
void Solve()
{
  int d;
  Left=Max;  Right=16000*16000;
 while(Left<=Right)
    {
      mid=(Left+Right)/2;
        d=nrtrans(mid);
      if(d<=k)
        {
          sol=mid;
           Right=mid-1;
        }
        else if(d>k) Left=mid+1;
    }
    fout<<sol;
}
int main()
{
   Read();

   Solve();
    return 0;
}