#include <fstream>

using namespace std;

int n, k, i, v[16001], x, mare=0, s=0, nr=1, sum=0, st, dr, mid;

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

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