#include<iostream>
#include<cmath>
#include<algorithm>
#include<fstream>
#include<vector>
#include<cctype>
#include<queue>
#include<cstring>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,r,st=1,dr=(1<<25),a[16005],m,p,s;
int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    while(st<dr)
    {
        m=(st+dr)/2;
        p=1;
        s=0;
        for(int i=1;i<=k;i++)
        {
            s=0;
            for(int j=p;j<=n;j++)
            {
                s+=a[j];
                if((s+a[j+1]>m||j==n)&&s<=m)
                {
                    p=j+1;
                    break;
                }
            }
        }
        if(p>n)
            dr=m;
        else
            st=m+1;
    }
    fout<<dr;
}