#include <fstream>
const int MAX=16500;

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");

int n,k,v[MAX],tr,sc,last,s;
int main()
{
    int dr,st,med,i;
    fin>>n>>k;
    for(i=1;i<=n;++i){
        fin>>v[i];
        s+=v[i];
    }
    st=1;
    dr=s;
    while(st<=dr)
    {
        med=st+(dr-st)/2;
        tr=0;sc=0;
        for(i=1;i<=n;++i)
        {
            if(v[i]>med){
            tr=k+1;
            break;
            }
            sc+=v[i];
            if(sc>med)
            {
                tr++;
                sc=v[i];
            }
        }
        tr++;
        if(tr<=k){
            last=med;
            dr=med-1;
        }
        else st=med+1;
    }
    fout<<last<<'\n';
    return 0;
}