#include <bits/stdc++.h>

using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int n,v[100],k,mx=0,s=0,sol,dr,st,mijl;
int main()
{
    in>>n>>k;
    for(int i=1;i<=n;i++)
    {
        in>>v[i];
        s+=v[i];
        if(v[i]>mx) mx=v[i];
    }
    st=mx;
    dr=s;
    while(st<=dr)
    {
        mijl=(st+dr)/2;
        int val,x,ks=1,ok=1;val=mijl;x=val;
        for(int i=1;i<=n;i++)
        {
            if(x<v[i])
            {
              x=val;
              ks++;
            }
            x-=v[i];
            if(ks>k) ok=0;
        }
        if(ks>k) ok=0;
        if(ok==1)
        {
            sol=mijl;
            dr=mijl-1;
        }
        else st=mijl+1;
    }
    out<<sol;

}