#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,m,k,s,mx,v[1000001];
int transport(int x)
{
    int s=0,nr=1;
    for(int i=1;i<=n;i++)
    {
        if(x>=s+v[i])s+=v[i];
        else{
            nr++;
            s=v[i];
        }
    }
    return nr;
}
int cb(int mx, int s, int k)
{
    int r=mx,pas;
    pas=1<<9;
    while(pas!=0)
    {
        if(r+pas<=s&&transport(r+pas)>k)r+=pas;
        pas/=2;
    }
    if(transport(r)==k) return r;
    if(transport(r+1)==k)return r+1;

}
int main()
{
    int i,j;
    fin>>n>>k;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        s+=v[i];
        mx=max(mx,v[i]);
    }
    fout<<cb(mx,s,k);
    return 0;
}