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

int verif(int x)
{
    int s=0, nrtr=1, i;
    for (i=1;i<=n;i++) {
        if (s+v[i]<=x)
            s+=v[i];
        else {
            nrtr++;
            s=v[i];
        }
    }

    return nrtr<=k;
}

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

    st=maxim;
    dr=s;
    while (st<=dr) {
        int mid = (st+dr)/2;
        if (verif(mid)==1)
            dr=mid-1;
        else
            st=mid+1;
    }

    fout<<st;
    return 0;
}