#include<fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,st,dr,mid,t,i,s,maxim,v[16001],j,k,ok,minim;
int main(){
    fin>>n>>k;
    dr=0;
    maxim=0;
    for(i=1;i<=n;i++){
        fin>>v[i];
        dr+=v[i];
        if(v[i]>maxim){
            maxim=v[i];
        }
    }
    st=maxim;
    while(st<=dr){
        mid=(st+dr)/2;
        s=0;
        t=1;
        for(i=1;i<=n;i++){
            s=s+v[i];
            if(s>mid){
                t++;
                s=v[i];
            }
        }
        if(t>k){
            st=mid+1;
        }
        else{
            dr=mid-1;
        }
    }
   fout<<st;
   return 0;
}