Pagini recente » Cod sursa (job #546433) | Cod sursa (job #2733081) | Cod sursa (job #2231438) | Cod sursa (job #1904374) | Cod sursa (job #2679635)
#include <iostream>
using namespace std;
int v[16000];
int N, k;
bool ok (int med)
{
int i, sc=0, nrtr=0;
for (i=1;i<=N;i++)
{
if (v[i]>med)
return 0;
if (sc+v[i]<=med)
sc=sc+v[i];
else
{
nrtr++;
sc=v[i];
}
}
nrtr++;
return (nrtr<=k);
}
int bsl (int st, int dr)
{
int med, last;
while (st<dr)
{
med=(st+dr)/2;
if (ok(med))
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int i;
long long s=0;
cin>>N>>k;
for (i=1;i<=N;i++)
{
cin>>v[i];
s+=v[i];
}
cout<<bsl(1, s);
return 0;
}