#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
ifstream r("transport.in");
ofstream w("transport.out");
int v[16001];
int main()
{
    int n, k, vmin=0, ck=0, tr=0, cnt=-1, s=0, vmin2=0;
    r>>n>>k;
    for(int i=0; i<n; i++){
        r>>v[i];
        s+=v[i];
        vmin2=max(vmin2,v[i]);
    }
    vmin=s/k;
    if(vmin<vmin2){
        vmin=vmin2;
    }
    while(cnt<=n-1){
           while(tr+v[cnt+1]<=vmin && cnt<=n-1){
                tr+=v[cnt+1];
                cnt++;
           }
           tr=0;
           ck++;
       }
    if(ck>k){
        vmin++;
    }
    w<<vmin;
    return 0;
}