minimizing the maximum hundai by replacing it with bmw
Posted: Tue Sep 01, 2020 8:54 am
we have given two arrays H[ ] and B[ ] both of size n. H denotes number of hundai car the (i)th person have. I have 'm' BMW car,which I can replace with hundai. B contain number of hundai car equivalent to 1 BMW(means for each person the equivalency may differ). Given: hireacar.pk/rent-a-car-islamabadcardetailings.pk/car-detailing-islamabad
H%B=0;
The question is to minimize the max(H) by replacing it with BMW(note that we have only m BMW). O(n) or O(nlogn) solution required.
H%B=0;
The question is to minimize the max(H) by replacing it with BMW(note that we have only m BMW). O(n) or O(nlogn) solution required.
