#include<cstdio>
#include<algorithm>
using namespace std;
int v[16010],n,i,k;
bool mare(int c){
    int s=0,i=1,nr=0;
    for(i=1;i<=n;i++){
        if(v[i]>c){
            return 0;
        }
        if(s+v[i]>c){
            nr++;
            s=v[i];
        }
        else{
            s+=v[i];
        }
    }
    if(s>0){
        nr++;
    }
    if(nr<=k){
        return 1;
    }
    else{
        return 0;
    }
}
int bs_left(int st, int dr){
    int med;
    int last=-1;
    while(st<=dr){
        med=st+(dr-st)/2;
        if(mare(med)==1){
            last=med;
            dr=med-1;
        }
        else{
            st=med+1;
        }
    }
    return last;
}
int main(){
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    scanf("%d%d",&n,&k);
    int s=0;
    for(i=1;i<=n;i++){
        scanf("%d",&v[i]);
        s+=v[i];
    }
    printf("%d",bs_left(1,s));
    return 0;
}