Pagini recente » Cod sursa (job #3318705) | Borderou de evaluare (job #3321341) | Cod sursa (job #3351982) | Cod sursa (job #3335280) | Cod sursa (job #3355488)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16002];
int main()
{
int nr,k,cnt,dr,st,sum,cap,i,ret;
cin>>nr>>k;
for(i=1,st=0,dr=0;i<=nr;i++)
{
cin>>v[i];
dr+=v[i];
if(v[i]>st)
{
st=v[i];
}
}
while(st<=dr)
{
cap=(st+dr)/2;
cnt=1;
sum=0;
for(i=1;i<=nr;i++)
{
if(sum+v[i]>cap)
{
cnt++;
sum=0;
}
sum+=v[i];
}
if(cnt>k)
{
st=cap+1;
}
if(cnt<=k)
{
ret=cap;
dr=cap-1;
}
}
cout<<ret;
return 0;
}