#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in"); ofstream g("transport.out");
int n,k,v[16002],lt=1,rt=256000000,md,mx;
bool verif()
{
    int s=0,p=1;
    for(int j=1;j<=n;++j)
    {
        if(s+v[j]>md)
        {
            s=v[j];
            ++p;
        }
        else s+=v[j];
    }
    if(s>md) ++p;
    if(p<=k) return 1;
    else return 0;
}
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;++i)
    {
        f>>v[i];
        mx=max(mx,v[i]);
    }
    while(rt-lt!=1)
    {
        md=(rt+lt)/2;
        if(verif()) rt=md;
        else lt=md;
    }
    if(rt<mx) rt=mx+1;
    g<<rt;
    return 0;
}