#include <fstream>

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");

int n, k, v[16001];

int verif(int c) {

    int t, ramas, i;
    t=1;
       ramas=c-v[1];
       for(i=2;i<=n;i++)
        if (v[i]<=ramas)
            ramas=ramas-v[i];
       else{
        t++;
        ramas=c-v[i];}
    return t <= k;
}

int main()
{
    int i, maxi = 0, s = 0, st, dr, mij;
    fin>>n>>k;
    for(i = 1; i <= n; i++)
    {
        fin>>v[i];
        if(v[i] > maxi)
            maxi = v[i];
        s = s + v[i];
    }
    st = maxi;
    dr = s;
    while(st <= dr) {
        mij = (st + dr) / 2;
        if(verif(mij))
            dr = mij - 1;
        else
            st = mij + 1;
    }
    fout<<mij;
    return 0;
}