#include <fstream>
#include <algorithm>
#define CEVA 16001
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, c_min=0, c_max=0, v[CEVA], c_camion;


void cautBin(int st, int dr){
    while(st<=dr){
        int mij=(st+dr)/2;
        int nr_drumuri=1, c_transport=0;
        for(int i=1; i<=n; i++){
            c_transport+=v[i];
            if(c_transport>mij){
                c_transport=v[i];
                nr_drumuri++;
            }
        }
        if(nr_drumuri>k){
            st=mij+1;
        }
        else{
            c_camion=mij;
            dr=mij-1;
        }
    }
}


int main()
{
    fin>>n>>k;
    for(int i=1; i<=n; i++){
        fin>>v[i];
        c_min=max(c_min,v[i]);
        c_max+=v[i];
    }

    cautBin(c_min,c_max);

    fout<<c_camion;

    return 0;
}