/*#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[100], n,k,cmax;
void cit(){
    fin>>n>>k;
    for(int i=1;i<=n;i++)
        fin>>v[i];}
int sePoateTransporta(int m){
    int i,j;
    for(i=1;i<=n;i++)
        for(j=i+1;j<=n;j++)

int main(){
    int i,s=0;
    cit();
    for(i=1;i<=n;i++)
        s+=v[i];
    int p=1,u=s,m=0;
    while (p<=u) {
        m=p+(u-p)/2;
        if (sePoateTransporta(m))
            u=m-1;
        else
            p=m+1;}
    fout<<p;
    return 0;}
*/
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,mx,s,c1,c2,mij,sf,nr,i,v[16001];
int main()
{
    f >> n >> k;
    mx = -1;
    for(i = 1; i <= n; ++i)
    {
        f >> v[i];
        if(v[i] > mx)
            mx = v[i];
        s += v[i];
    }
    c1 = mx;
    c2 = s;
    while(c1 <= c2)
    {
        mij = (c1 + c2) / 2;
        nr = 1;
        for(i = 1; i <= n; ++i)
        {
            sf += v[i];
            if(sf > mij)
            {
                sf = v[i];
                nr++;
            }
        }
        if(sf <= mij)
        {
            if(nr > k)
                c1 = mij + 1;
            else
                c2 = mij - 1;
            sf = 0;
        }
    }
    g << c1 << '\n';
    return 0;
}