#include <iostream>
#include <algorithm>

using namespace std;

int v[16005], v2[16005];

int test(int n, int k, int c)
{
    int sum = 0, cnt = 1;
    for(int i=1;i<=n;i++)
    {
        if(v[i] > c)
            return 999999;

        if(sum+v[i] > c)
        {
            cnt++;
            sum=v[i];
        }
        else
        {
            sum+=v[i];
        }
    }
    return cnt;
}

int main()
{
    //ifstream cin("transport.in");
    //ofstream cout("transport.out");
    int n, k, mx=0, mx2;
    cin >> n >> k;
    for(int i=1;i<=n;i++)
    {
        cin >> v[i];
        v2[i] = v2[i-1] + v[i];
        mx = max(mx, v[i]);
    }
    mx = v[1];

    for(int i=1;i<=n;i++)
    {
        int x = test(n, k, v2[i]);
        if(x <= k)
        {
            mx2 = v2[i];
            break;
        }
    }

    mx2 = v2[n];

    int st=mx, dr=mx2, mij, res=99999;
    while(st<=dr)
    {
        mij = (st+dr)/2;
        if(test(n,k,mij)<=k)
        {
            res = min(res,mij);
            dr=mij - 1;
        }
        else
        {
            st=mij + 1;
        }
    }
    cout << res;
    return 0;
}