#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[20005];
int main()
{
    int n, k, suma=0, maxim=0;
    fin >> n >> k;
    for(int i=1; i<=n; i++)
    {
        fin >> v[i];
        suma+=v[i];
        maxim=max(maxim, v[i]);
    }
    int st=maxim-1, dr = suma+1, mid;
    while(st<dr-1)
    {
        mid=(st+dr)/2;
        int nr=0;
        int sum=0;
        for(int i=1; i<=n; i++)
        {
            if(sum+v[i]<=mid)
                sum+=v[i];
            else
            {
                nr++;
                sum=v[i];
            }
        }
        if(sum>0)
            nr++;
        if(nr<=k)
            dr = mid;
        else
            st = mid;
    }
    fout << dr;
    return 0;
}