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