#include <fstream>

using namespace std;

ifstream f("transport.in");
ofstream g("transport.out");
int v[16002],n,i,k,j,st,dr,mij,minim;
long int s;
inline bool solve(int x)
{
    long int sum=0,nr=1,i;
    for(i=1;i<=n;i++)
        if(sum+v[i]>x) {sum=0,++nr,--i;
        if(nr>k)return false;}
        else sum+=v[i];
    return true;
}
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++) f>>v[i],s+=v[i];
    st=1,dr=s,minim=dr;
    while(st<=dr)
    {
        mij=(st+dr)>>1;
        if(solve(mij))
        {dr=mij-1;
        if(mij<minim) minim=mij;}
        else st=mij+1;
    }
    g<<minim;
    f.close();g.close();
    return 0;
}