#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX=16000;
int v[NMAX + 1];

int minCap(int x, int k, int n){
    int diff, i, j=1;
    for (i=1;i<=k;i++){
        diff=x;
        while (diff>0){
            diff=diff-v[j++];
        }
        j--;
        if (j==n){
            return 1;
        }
    }
    return 0;
}

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