Pagini recente » Cod sursa (job #654938) | Cod sursa (job #3250178) | Cod sursa (job #2200844) | Monitorul de evaluare | Cod sursa (job #1524591)
#include <fstream>
using namespace std;
int n, k, i, v[16001], x, mare=0, s=0, nr=0, sum=0, st, dr, mid;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main(){
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
if(mare<v[i])
mare=v[i];
sum+=v[i];
}
st=mare;
dr=sum;
while(st<=dr){
mid=(st+dr)/2;
for(i=1;i<=n;i++){
s+=v[i];
if(s>mid){
s=0;
nr++;
i--;
}
if(nr>k)
break;
}
if(nr>k)
st=mid+1;
else
dr=mid-1;
nr=0;
}
fout<<st;
return 0;
}