Pagini recente » Borderou de evaluare (job #2311907) | Cod sursa (job #3189542) | Borderou de evaluare (job #2090813) | Borderou de evaluare (job #1757989) | Cod sursa (job #2656364)
#include <iostream>
using namespace std;
int n,k,v[16001];
bool ok(int c)
{
int i,tr,sc;
sc=tr=0;
for(i=1;i<=n;i++)
{
if(v[i]>c)
return 0;
if(sc+v[i]<=c)
sc=sc+v[i];
else
{
tr++;
sc=v[i];
}
}
if(sc>0)
tr++;
return tr<=k;
}
int bs_left(int st,int dr)
{
int med,last=-1;
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,st,dr,sum=0;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
sum=sum+v[i];
}
dr=sum;
st=1;
cout<<bs_left(st,dr);
return 0;
}