Pagini recente » Cod sursa (job #2500643) | Cod sursa (job #1666451) | Cod sursa (job #284775) | Cod sursa (job #1275994) | Cod sursa (job #1153235)
#include<fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16005],n,k;
int verif(int capac)
{
int i, nr=1 ,suma=0 ;
for(i=1;i<=n;i++)
{
if(v[i]>capac)
return 0;
if(suma+v[i]<=capac)
suma+=v[i];
else
{
nr++;
suma=v[i];
}
}
return nr<=k;
}
int main ()
{
int i,j,dev;
in>>n>>k;
for(i=1;i<=n;i++)
in>>v[i];
i=0;
dev=1<<27;
while(dev)
{
if(!verif(i+dev))
i+=dev;
dev/=2;
}
out<<i+1<<'\n';
return 0;
}