#include <iostream>
#include <stdio.h>
#include <fstream>
#define MAX_N 16009
using namespace std;
int v[MAX_N],n,k;
long long int answer=MAX_N,l,r;
ofstream out("transport.out");
int maxim(int a, int b)
{
    if(a<b) return b;
    return a;
}
int minim(long long int a, long long int b)
{
    if(a<b) return a;
    return b;
}
void citire()
{
    freopen("transport.in", "r", stdin);
    scanf("%d %d",&n, &k);
    int i;
    for(i=1; i<=n; i++)
    {
        scanf("%d",&v[i]);
        l=maxim(l,v[i]);
        r+=v[i];
    }

}
int numar_curent_transporturi(int m)
{
    int gr=0, gr2=0;
        for (int i=1;i<=n;++i)
        {
            gr=gr+v[i];
            if (gr>m)
            {
                gr=v[i];
                ++gr2;
            }
        }
        return gr2;
}
void cautare_binara(int left, int right)
{
    //out<<left<<' '<<right<<endl;
    if(left<=right)
    {
        int m=(left+right)/2,current_value;

        current_value=numar_curent_transporturi(m);

        if(current_value<=k)
        {
            answer=minim(answer,m);
            cautare_binara(left,m-1);
        }
        else cautare_binara(m+1,right);
    }

}
int main()
{
    citire();
    cautare_binara(l,r);
    out<<answer;
    return 0;
}