#include <iostream>
#include <cmath>
#include<fstream>

using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
    int n,k,v[16001],i,vmin,s=0,maxx=0,gasit=0;
    fin>>n>>k;
    for (i=1;i<=n;i++)
       {fin>>v[i];
        s=s+v[i];
        if (v[i]>maxx) maxx=v[i];}
    if (ceil(s/k)>maxx) maxx=ceil(s/k);
    while (!gasit) {
        i=1;
        int j=0;
        while (i<=n){
            s=0;
            while(i<=n&&s + v[i]<=maxx){
                s=s+v[i];
                i++;
            }
            j++;
        }
        if (j<=k) gasit=1;
        else maxx++;
    }
    fout<<maxx;

    return 0;}