#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16001],n,k;
int cool(int a)
{
 int nr=0,x=0;
    for(int i=1;i<=n;i++)
    {
        if(x+v[i]<=a)
            x+=v[i];
        else
        {
            x=v[i];
            nr++;
        }
    }
    nr++;
    return nr;
}
int cautare(int st, int dr)
{
    long mj=st+(dr-st)/2;
    while(st<=dr)
    {
     mj=(st+dr)/2;
     if(cool(mj)==k)
     return mj;
     if(cool(mj)<k)
     st=mj+1;
     else
     dr=mj-1;   
    }
    }
int main()
{
    int i,s=0,maxi=0;
    in>>n>>k;
    for(i=1;i<=n;i++)
    {
     in>>v[i];
     s+=v[i];
     maxi=max(maxi,v[i]);   
    }
    out<<cautare(maxi,s);
    return 0;
}