#include <bits/stdc++.h>
using namespace std;
const int nmax = 2e4+5;
ifstream in ("transport.in");
ofstream out ("transport.out");
int v[nmax];
int check(int nr,int n)
{
    int cap=nr,parcurgeri=1;
    for(int i=1;i<=n;i++){
        if(cap>=v[i])
        {
            cap-=v[i];
        }
        else if (nr>=v[i])
        {
            parcurgeri++;
            cap=nr-v[i];
        }
        else{
            return INT_MAX;
        }
    }
    return parcurgeri;
}

int main()
{
    int n,k,sum=0;
    in>>n>>k;
    for (int i=1;i<=n;i++){
        in>>v[i];
        sum+=v[i];
    }
    int st=1,dr=sum,lastmed;
    while (st<=dr)
    {
        int med=(st+dr)/2;
        int parcurgerimed=check(med,n);
        if(parcurgerimed>k)
        {
            st=med+1;
        }
        else if (parcurgerimed<=k)
        {
            dr=med-1;
            lastmed=med;
        }
    }
    out << lastmed;
    return 0;
}