Pagini recente » Cod sursa (job #2824395) | Cod sursa (job #2323139) | Cod sursa (job #2824408) | Cod sursa (job #797916) | Cod sursa (job #3256126)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int n,k,cap,v_max,sum,st,dr,nr_trns,x;
int main()
{
fin>>n>>k;
int slt[n+1];
for(int i=1;i<=n;i++){
fin>>slt[i];
sum=sum+slt[i];
v_max=max(v_max,slt[i]);
}
st=v_max;
dr=sum;
sum=0;
cap=(st+dr)/2;
while(st<=dr){
x=0;
nr_trns=0;
cap=(st+dr)/2;
for(int i=1;i<=n;i++){
sum=sum+slt[i];
if(sum+slt[i]>cap){
sum=0;
nr_trns++;
}
}
nr_trns++;
if(nr_trns<=k){
dr=(st+dr)/2-1;
}else if(nr_trns>k){
st=(st+dr)/2+1;
}
}
fout<<cap;
return 0;
}