#include <fstream>

using namespace std;

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