#include <iostream>
#include <cstdio>
#include <algorithm>
FILE *f,*g;
using namespace std;

int N,K,v[16001];

int cautbin(int left, int right)
{
    int mij, s, t, i;
    while(left<right)
    {
        mij=left+(right-left)/2;
        s=0;
        t=1;
        for(i=1; i<=N; i++)
        {
            if(s+v[i]<=mij)
            {
                s+=v[i];
            }
            else
            {
                t++;
                s=v[i];
            }
        }
        if(t>K) left=mij+1;
        else right=mij;
    }
    return left;
}

int main()
{
    f=fopen("transport.in","r");
    g=fopen("transport.out","w");
    int i,sum=0,k,maxim=0;
    fscanf(f,"%d%d",&N,&K);
    for(i=1;i<=N;i++)
    {
        fscanf(f,"%d",&v[i]);
        sum=sum+v[i];
        if(v[i]>maxim)
            maxim=v[i];
    }
    k=cautbin(0,sum);
    if(k<maxim)
        fprintf(g,"%d",maxim);
    else
        fprintf(g,"%d",k);
    fclose(f);
    fclose(g);
    return 0;
}