#include <fstream>
using namespace std;

int n,k,v[16005],i;
long long s,st,dr,mid;

bool ok(long long x)
{
    bool ok1=1;
    int nr=1;
    long long sum=0;
    for(i=1;i<=n;i++)
    {
        if(v[i]>x)
        {
            ok1=0;break;
        }
        if(sum+v[i]>x)
        {nr++;sum=v[i];}
        else
            sum+=v[i];
    }
    if(nr>k)
        ok1=0;
    return ok1;
}

int main()
{
    ifstream f("transport.in");
    ofstream g("transport.out");
    f>>n;f>>k;
    for(i=1;i<=n;i++)
    {
        f>>v[i];
        s+=v[i];
    }
    st=1;dr=s;
    while(st<=dr)
    {
        mid=(st+dr)/2;
        if(ok(mid))
            dr=mid-1;
        else
            st=mid+1;
    }
    g<<st<<"\n";
    f.close();g.close();
    return 0;
}