#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,suma,i,st,dr,c,cc,v[16010],maxim,tr;
int main() {
    fin>>n>>k; maxim=0; suma=0;
    for (i=1;i<=n;i++) {
        fin>>v[i]; suma+=v[i];
        if (v[i]>maxim)
            maxim=v[i];
    }
    st=maxim; dr=suma;
    while (st<=dr){
        c=(st+dr)/2;
        cc=c-v[1]; tr=1;
        for (i=2;i<=n;i++) {
            if (cc>=v[i])
                cc-=v[i];
            else {
                tr++; cc=c-v[i];
            }
        }
        if (tr>k)
            st=c+1;
        else
            dr=c-1;
    }
    fout<<st;
    return 0;
}