#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16001],n,k,sum,maxim;
int transporturi(int a)
{
    int volum=0,trans=1;
    for(int i=1;i<=n;i++)
    {
        if(volum+v[i]<=a)
            volum+=v[i];
        else
        {
            trans++;
            volum=v[i];
        }
        if(trans>k)
            return 0;
    }
    if(trans<=k)
        return 1;
}
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)
    {
        f>>v[i];
        if(v[i]>maxim)
            maxim=v[i];
        sum+=v[i];
    }
    if(transporturi(maxim))
        g<<maxim;
    else
    {
        int left=maxim,right=sum;
        while(left<=right)
        {
            int mij=(left+right)/2;
            if(transporturi(mij))
            {
                right=mij-1;
            }
            else
                left=mij+1;
        }
        if(transporturi(right))
            g<<right;
        else
            g<<left;
    }
    return 0;
}