#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,i,v[16001],c,st,dr,mi,s,poz;
bool good(int c)
{
    int nr=0,kc=0;
    for(int i=1;i<=n;i++)
    {
        if(kc+v[i]>c)
        {nr++;
        kc=v[i];}
        else kc+=v[i];
    }
    nr++;
    return nr<=k;
}
int main()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)
        {fin>>v[i];
        s+=v[i];}
    st=*max_element(v+1,v+n+1);
    dr=s;
    while(st<=dr)
    {
        mi=(st+dr)/2;
        if(good(mi))
        {dr=mi-1;
        poz=mi;}
        else st=mi+1;
    }
    fout<<poz;
}