#include <iostream>
#include <fstream>
#define Maxx 16001
//eram curios sa vad cate puncte ia fara cautare binara :)
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,A[Maxx],i,mx,sum;
int valid_k(int x)
{
    int trans=0,ac=0;
    for (int i=1;i<=n;i++)
    {
        if (ac+A[i]>x)
        {
            trans++;
            ac=A[i];
        }
        else
            ac+=A[i];
    }
    if (ac>0)
        trans++;
    return trans;
}
int bin_search(int st,int dr,int k)
{
    int m=(st+dr)/2,x;
    x=valid_k(m);
    if (st>dr) return st;
    if (x>k) return bin_search(m+1,dr,k);
    else return bin_search(st,m-1,k);
}
int main()
{
    fin>>n>>k;
    for (i=1; i<=n; i++)
    {
        fin>>A[i];
        mx=max(A[i],mx);
        sum+=A[i];
    }
    fout<<bin_search(mx,sum,k);
    return 0;
}