Pagini recente » Cod sursa (job #478209) | Cod sursa (job #64962) | Cod sursa (job #2771971) | Borderou de evaluare (job #10040) | Cod sursa (job #2120290)
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k;
int v[16004];
bool verif(int C)
{
int s=0,i,pasi=0;
for(i=1;i<=n;i++)
{
if(v[i]>C || pasi>k)
return 0;
if(s+v[i]<=C)
s+=v[i];
else
{
pasi++;
s=v[i];
}
}
pasi++;
if(pasi<=k)
return 1;
return 0;
}
int main()
{
int st=1,dr=1000000,mij;
int i;
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
while(st<=dr)
{
mij=(st+dr)/2;
if(verif(mij)==1)
dr=mij-1;
else
st=mij+1;
}
g<<st;
}