#include <fstream>
using namespace std;
int main () {
    int n,k,sum=0,maxim=-1,tr,v[20000];
    ifstream fin("transport.in");
    ofstream fout("transport.out");
    fin>>n>>k;
    for(int i=1;i<=n;i++){
        fin>>v[i];
        sum+=v[i];
        if(v[i]>maxim)
            maxim=v[i];
    }
    int st=maxim;
    int dr=sum;
    while(st<=dr){
        int c=(st+dr)/2;
        int cc=c-v[1];
        tr=1;
        for(int i=2;i<=n;i++)
            if(cc>=v[i])
                cc-=v[i];
            else{
                cc=c-v[i];
                tr++;
            }

    if(tr>k)
        st=c+1;
    else
        dr=c-1;
    }
    fout<<st;









    return 0;
}