#include <stdio.h>
using namespace std;
int n,k,v[16000],st,dr,l,drum,s;
void bin(int cs,int cd);
int main ()
{
    FILE *fin;
    fin=fopen ("transport.in","r");
    fscanf(fin,"%d %d",&n,&k);
    for(int i=0; i<n; ++i)
    {
        fscanf(fin,"%d",&v[i]);
        dr+=v[i];
        if(v[i]>st)st=v[i];
    }
    bin(st,dr);
}
void bin(int cs, int cd)
{
    FILE *fout;
    fout=fopen ("transport.out","w");
    s=v[0];
    drum=1;
    l=(cs+cd)/2;
    for(int i=1; i<n; ++i)
    {
        if(v[i]+s<=l)
        {
            s+=v[i];
            continue;
        }
        else
        {
            drum++;
            s=v[i];
            if(drum>k)
            {
                if(cs==cd)
                {
                    fprintf(fout," %d",l);
                    fclose (fout);
                    return;
                }
                bin((cs+cd)/2+1,cd);
            }
        }
    }
    if(cs==cd)
    {
        fprintf(fout," %d",l);
        fclose (fout);
        return;
    }
    bin(cs,(cd+cs)/2);
}