Not able to solve this question HELP!

#1

I tried for the long time but not able to understand need and solution to problem below is incomplete code Please help to complete it with brief explaination

#2

In this question you have to find minimum time required to paint the board using k painter. So you can apply binary search over time. If it’s possible to paint board using mid unit of time then your search space would reduce to start to mid-1. Otherwise you search space become mid+1 to end.

#3

yeah i tried that but i am not able to figure is possible part!!!
please take a look at code and please help me modify it ??

#4

@rastogi.g1998
Your code till check is correct. Just use long long int . I have code rest of the program. Please check here https://ide.codingblocks.com/s/239556
Check whether it is working or not

#5

its shows wrong testcases in all

#6

ITS NOT WORKING also why did we multiply *t with s,e??