Pagini recente » Cod sursa (job #1716581) | Cod sursa (job #1408814) | Cod sursa (job #482248) | Cod sursa (job #542295) | Cod sursa (job #2924468)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[17000];
int main()
{
int n,k,i,sol,l,tr,st,dr,ok=0,mij,m=-1,s=0;
in>>n>>k;
for(i=1;i<=n;i++)
{
in>>v[i];
s+=v[i];
if(v[i]>m)
m=v[i];
}
st=m;
dr=s;
while(st<=dr)
{
mij=(st+dr)/2;
tr=1;
l=0;
for(i=1;i<=n;i++)
{
if(l+v[i]<=mij)
l+=v[i];
else
{
tr++;
l=v[i];
}
}
if(tr>k)
{
st=mij+1;
}
else
{
sol=mij;
dr=mij-1;
}
}
out<<sol;
return 0;
}