#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16001],n,k,p,u,s,maxim,m;
int verif(int m)
{
    int sum=0,nr=0;
    for(int i=1;i<=n&&nr<k;++i)
    {
        if(sum+v[i]<=m)
            sum+=v[i];
        else
        {
            sum=v[i];
            nr++;
        }
    }
    if(nr>=k)
        return 0;
    return 1;
}
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;++i)
    {
        f>>v[i];
        s+=v[i];
        if(v[i]>maxim)
            maxim=v[i];
    }
    p=maxim;
    u=s;
    while(p<u)
    {
        m=(p+u)/2;
        if(!verif(m))
            p=m+1;
        else
            u=m;
    }
    m=(p+u)/2;
    while(!verif(m))
       ++m;
    g<<m;
    return 0;
}