Pagini recente » Cod sursa (job #1381669) | Cod sursa (job #1551779) | Cod sursa (job #2572892) | Cod sursa (job #1837533) | Cod sursa (job #1760349)
#include <iostream>
#include <fstream>
using namespace std;
int v[20000];
int main()
{
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,k,s=0,c,nrc=0,suma=0,ma=0;
cin>>n>>k;
for(int i=1; i<=n; i++)
{
cin>>v[i];
suma=suma+v[i];
if(v[i]>ma)
ma=v[i];
}
int st=ma,dr=suma;
while(dr>st)
{
nrc=0;
c=(st+dr)/2;
s=0;
for(int i=1; i<=n; i++)
{
if(v[i]+s<=c)
{
s=s+v[i];
}
else
{
s=v[i];
nrc++;
}
}
if(nrc<k)
{
dr=c-1;
}
else
{
st=c+1;
}
}
cout<<st;
return 0;
}