#include <fstream>
using namespace std;
int n, k, i, j, st, dr, tr, cc, maxim, s;
int v[16001];

int main () {
    ifstream fin ("transport.in");
    ofstream fout ("transport.out");
    fin>>n>>k;
    for (i=1;i<=n;i++) {
        fin>>v[i];
        if (v[i]>maxim)
            maxim=v[i];
        s+=v[i];
    }

    st=maxim;
    dr=s;
    while (st<=dr) {
        int mid = (st+dr)/2;
        cc=mid-v[1];
        tr=1;
        for (i=2;i<=n;i++) {
            if (cc>=v[i])
                cc-=v[i];
            else {
                tr++;
                cc=mid-v[i];
            }
        }
        if (tr>k)
            st=mid+1;
        else
            dr=mid-1;
    }

    fout<<st;
    return 0;
}