#include <iostream>
#include <fstream>

using namespace std;

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

int n,k,st,dr,mij, ans, v[16003],maxim,suma;
int verif (int var)
{
    int q=1,s=0,drum=0;
    for(int j=1;j<=n;j++)
    {
        if (s+v[j]<=var)
        {
            s+=v[j];
            continue;
        }
        s=v[j];
        drum++;
    }
    return drum<k;

}
int main()
{
    f>>n>>k;
    for(int i=1; i<=n; i++)
    {
        f>>v[i];
        if (v[i]>maxim) maxim=v[i];
        suma+=v[i];
    }
    st=maxim;
    dr=suma;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if (verif(mij))
        {
            ans=mij;
            dr=mij-1;
        }
        else st=mij+1;
    }
    g<<ans;
    return 0;
}