#include <iostream>
#include <fstream>
using namespace std;

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

const int maxn = 16002;
int n, k, v[maxn], maxim, sum;

int check(int val)
{
    int res=1, s=0;
    for(int i=1; i<=n; i++)
    {
        s=s+v[i];
        if(s>val)
        {
            res++;
            s=v[i];
        }
    }
    return res;
}

int main()
{
    fin>>n>>k;
    for(int i=1; i<=n; i++)
    {
        fin>>v[i];
        maxim=max(maxim, v[i]);
        sum=sum+v[i];
    }
    int st=maxim, dr=sum, res;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        if(check(mid)<=k)
        {
            res=mid;
            dr=mid-1;
        }
        else
        {
            st=mid+1;
        }
    }
    fout<<res;
    return 0;
}