if the logic for this question is name as book allocation problem then why am I getting WA. https://ide.codingblocks.com/s/105926
Getting WA after submitting
@akh.chakraborty11
While the approach is similar, it is not exactly same. The binary search algorithm should work for the total time taken. You have not considered the time factor in your function at all.
Your starting for binary search would be max_element_of_array * t , where t is the time taken by one painter to paint one board.
Your ending point would be sum_of_all_elements_in_array * t .
It is time that we need to minimise , so we have to run the binary search on search space of time only or we will get the wrong answer.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.