#include<iostream>
#include<fstream>
using namespace std;

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

int n,v[16001];

int calc_drumuri(long long c)
{
    int i,k=0;
    long long copie=c;
    for(i=1;i<=n;i++)
    {
        if(copie-v[i]>0)
            copie-=v[i];
        else
        {
            k++;
            copie=c;
            copie-=v[i];
        }
    }
    return k;
}

int main()
{
    int k,i,maxx=0;
    long long st,dr,mij,mem;
    fin>>n>>k;
    for(i=1;i<=n;i++)
        fin>>v[i];
    for(i=1;i<=n;i++)
        if(v[i]>maxx)
            maxx=v[i];
    st=maxx;
    dr=256000000;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(calc_drumuri(mij)<=k)
        {
            mem=mij;
            dr=mij-1;
        }
        else
        {
            st=mij+1;
        }
    }
    fout<<mem;

    fin.close();
    fout.close();
    return 0;
}