Pagini recente » Cod sursa (job #1159816) | Cod sursa (job #1680419) | Cod sursa (job #2779248) | Cod sursa (job #3033473) | Cod sursa (job #383955)
Cod sursa(job #383955)
#include<fstream.h>
ifstream f("transport.in");
ofstream g("transport.out");
int v[16001],n,k,s,i,max,t,c,st,dr,gasit,m;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{f>>v[i];
s=s+v[i];
if(v[i]>max) max=v[i];}
st=max; dr=s; c=gasit=0; t=1;
while(st<=dr&&gasit==0)
{m=(st+dr)/2;
for(i=1;i<=n;i++)
{if(v[i]+c<=m) c=c+v[i];
else {c=v[i];t++;}}
if(t==k) gasit=1;
else if(t<k) dr=m-1;
else st=m+1;}
g<<m;
f.close(); g.close();
return 0;
}