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

        }
        if(contor<=K)
        {
            sol=mid;
            dr=mid-1;
        }
        else
        {
            st=mid+1;
        }
    }
    fout<<sol;
    return 0;
}