#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int N, K, p, u, mij, minim, V[16010];

bool Solve(int nr)
{
    int s = 0, nrk = 1;
    for (int i=1; i<=N; i++)
    {
        s += V[i];
        if (s > nr)
        {
            s = V[i];
            nrk++;
        }
    }
    return (nrk <= K);
}

int main()
{
    fin >> N >> K;
    for (int i=1; i<=N; i++) fin >> V[i], u += V[i], p = max(p, V[i]);

    minim = u;
    while (p <= u)
    {
        mij = (p + u) / 2;
        if (Solve(mij))
        {
            u = mij - 1;
            if (mij < minim) minim = mij;
        }
        else
        {
            p = mij + 1;
        }
    }

    fout << minim << '\n';
    fout.close();
    return 0;
}