#include <fstream>
#include <limits>
#define INF numeric_limits<int>::max()
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int a[16006],n,k;
bool check(int cap)
{
    int cnt=1,s=0;
    for(int i=1;i<=n;i++)
    {
        s+=a[i];
        if(s>cap)
        {
            s=a[i];
            cnt++;
        }
    }
    return (cnt<=k);
}
int main()
{
    in>>n>>k;
    int left=-INF,right=0;
    for(int i=1;i<=n;i++)
    {
        in>>a[i];
        left=max(left,a[i]);
        right+=a[i];
    }
    while(left<right)
    {
        int mid=(left+right)/2;
        bool ok=check(mid);
        if(ok==true)right=mid-1;
        else left=mid+1;
    }
    int sol=(left+right)/2;
    if(check(sol)==true)
    {
        for(;check(sol);sol--);
        sol++;
    }
    else{
        for(;!check(sol);sol++);
        sol--;
    }
    out<<sol<<'\n';
    return 0;
}