#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,i,s,st,dr,mid,maxim,ramas,j;

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