Pagini recente » Cod sursa (job #2345705) | Cod sursa (job #3288605) | Cod sursa (job #3199256) | Cod sursa (job #25305) | Cod sursa (job #3294475)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstdlib>
#include <ctime>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16000];
int main()
{
int n,k,C_min=256000001;
fin>>n>>k;
for(int i=0;i<n;i++)
fin>>v[i];
int st=1,dr=256000000;
while(st<=dr)
{
int mij=(st+dr)/2;
int ture=1,c=0;
for(int i=0;i<n;i++)
{
if(c+v[i]>mij)
{
ture++;
c=v[i];
}
else
c=c+v[i];
}
if(ture>k)
st=mij+1;
else
{
if(mij<C_min)
C_min=mij;
dr=mij-1;
}
}
fout<<C_min;
return 0;
}