#include <iostream>
#include <fstream>

using namespace std;

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

int n;
int v[16001];
int k;

int transport(int x)
{
    int sum=0;
    int cont=0;
    for(int i=1;i<=n;i++)
    {
        if(sum+v[i]<=x)
        {
            sum+=v[i];
        }
        else
        {
            sum=v[i];
            cont++;
            if(cont>k) return -1;
        }
    }
    if(cont+1>k) return -1;
    else return 1;
}

int main()
{
    fin >> n >> k;
    for(int i=1;i<=n;i++)
    {
        fin >> v[i];
    }
    int st=1,dr=256000005;
    int minim=2000000000;
    int sol=0;
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(transport(m)==-1) st=m+1;
        else
        {
            sol=m;
            dr=m-1;
        }
    }
    fout << sol;
}