Pagini recente » Cod sursa (job #2873125) | Cod sursa (job #1448345) | Cod sursa (job #3283632) | Cod sursa (job #1323389) | Cod sursa (job #2088691)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int n,k,stiva[16001];
bool verificat(int cap)
{
int nr=1,s=0;
for(int i=0; i<n; i++)
{
if(s+stiva[i]>cap)
{
nr++;
s=stiva[i];
}
else s=s+stiva[i];
}
if(nr>k) return false;
return true;
}
int cautcap(int cap)
{
int r = 0, pas = 1 << 27;
while (pas != 0)
{
if (r + pas < cap || !verificat(r + pas))
{
r += pas;
}
pas /= 2;
}
r++;
return r;
}
int main()
{
int cap=0;
in>>n>>k;
for(int i=0; i<n; i++)
{
in>>stiva[i];
if(stiva[i]>cap) cap=stiva[i];
}
out<<cautcap(cap);
return 0;
}