#include <fstream>

using namespace std;

const int N=16001;

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

int a[N];
int n, k, maxs=0;

bool verif(int x)
{
    if(x<maxs) return 0;
    int i, s=0, sol=0;
    for(i=1;i<=n;i++)
    {
        if(s<a[i])
        {
            s=x-a[i];
            sol++;
        }
        else
        {
            s-=a[i];
        }
    }
    if(sol<=k) return 1;
    return 0;
}

int main()
{
    int i, st=1, dr=0, mid,  sol;
    fin>>n>>k;
    for(i=1;i<=n;i++)
    {
        fin>>a[i];
        dr+=a[i];
        if(a[i]>maxs) maxs=a[i];
    }
    while(st<=dr)
    {
        mid=(st+dr)/2;
        if(verif(mid))
        {
            sol=mid;
            dr=mid-1;
        }
        else
        {
            st=mid+1;
        }
    }
    fout<<sol;
}