#include <fstream>
using namespace std;
ifstream fi ("transport.in");
ofstream fo ("transport.out");
int a[16007],i,st,dr,k,n,mij,sol;
bool verif (int x)
{
  int ndrum=1,c=0;
  for (i=1;i<=n;i++)
  {
    c+=a[i];
    if (c>x)
    {
      c=a[i];
      ndrum++;
    }
    if (ndrum>k) return 0;
  }
  return 1;
}
int main()
{
    fi>>n>>k;
    for (i=1;i<=n;i++) {fi>>a[i];st=max(st,a[i]);}
    dr=16000;
    while (st<=dr)
    {
      mij=(st+dr)/2;
      if (verif(mij))
      {
        sol=mij;
        dr=mij-1;
      }
      else st=mij+1;
    }
    fo<<sol;
    return 0;
}