Pagini recente » Cod sursa (job #1048500) | Cod sursa (job #2869185) | Cod sursa (job #3226232) | Cod sursa (job #2122122) | Cod sursa (job #1848923)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int gr[16001],n,k,ls,ld,mij;
int verif(int x)
{
int s=0,kk=1;
for(int i=1;i<=n;i++)
{
if(s+gr[i]>x)
{
s=gr[i];
kk++;
}
else s+=gr[i];
}
if(kk<=k)return 1;
return 0;
}
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>gr[i];
ld+=gr[i];
if(gr[i]>ls)ls=gr[i];
}
while(ls<ld)
{
mij=(ls+ld)/2;
if(verif(mij))ld=mij;
else ls=mij+1;
}
fout<<ld;
return 0;
}