#include <fstream>
#include <iostream>

using namespace std;

ifstream f("transport.in");
ofstream g("transport.out");

const int Nmax=16000;

int n, v[Nmax], k, final;

bool ok(int mijl)
{
    int suma=0, contor=1;
    for(int i=1; i<=n; i++)
    {
        suma += v[i];
        if(suma > mijl) suma=v[i], contor++;
    }
    if(contor <= k) return 1;
    else return 0;
}

void binar()
{
    int s=1, d=Nmax, mijl;
    while (s <= d)
    {
        mijl = (s+d)/2;
        if(ok(mijl))
        {
            final=mijl;
            d=mijl-1;
        }
        else s=mijl+1;
    }
}

int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++) f>>v[i];
    binar();
    g<<final<<'\n';
    return 0;
}