Pagini recente » Cod sursa (job #1155644) | Cod sursa (job #1197772) | Cod sursa (job #768036) | Cod sursa (job #635960) | Cod sursa (job #2807684)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, v[16001], i, k, st=-1, dr=0, mij,s=0,aux,kk;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
if(v[i]>st)
st=v[i];
dr+=v[i];
}
while(st<=dr)
{
mij=(st+dr)/2;
s=0;
kk=0;
for(i=1;i<=n;i++)
{
if(s+v[i]<=mij)
s+=v[i];
else
{
s=v[i];
kk++;
}
}
kk++;
if(kk>k)
st=mij+1;
else
{
dr=mij-1;
aux=mij;
}
}
fout<<aux;
return 0;
}