#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int Nmax=16000+5;
int n,k,s,hi,lo,mid;
int a[Nmax];
int calc(int x)
{
    int s=0,c=1;
    for(int i=1;i<=n;++i)
        if(s+a[i]<=x)s+=a[i];
        else
        {
            s=a[i];
            if(c<k)c++;
            else return -1;
        }
    if(s>x)return -1;
    return 1;
}
int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;++i)
    {
        fin>>a[i];
        s+=a[i];
    }
    lo=-1;hi=s;
    while(hi-lo>1)
    {
        mid=lo+(hi-lo)/2;
        if(calc(mid)!=-1)hi=mid;
        else lo=mid;
    }
    if(calc(lo)!=-1)fout<<lo;
    else fout<<hi;
    return 0;
}