#include <iostream>
#include <fstream>
using namespace std;
int t[100000];
int main()
{
    ///Problema transport InfoArena
    ifstream fin("transport.in");
    ofstream fout("transport.out");
    int N,K,i,sol,st,mid,dr,copmid,maxim=-1,contor=0;
    fin>>N>>K;
    for(i=1;i<=N;i++)
    {
        fin>>t[i];
        maxim=max(t[i],maxim);
    }
    st=maxim;
    dr=640010;
    while(st<=dr)
    {
        mid=(st+dr)/2;
        copmid=mid;
        contor=1;
        for(i=1;i<=N;i++)
        {
            if(copmid>=t[i])
                copmid-=t[i];
            else
            {
                copmid=mid;
                copmid-=t[i];
                contor++;
            }
        }
        if(contor<=K)
        {
            sol=mid;
            dr=mid-1;
        }
        else
        {
            st=mid+1;
        }
    }
    fout<<sol;
    return 0;
}