So, This question was asked in De Shaw coding round. It is kind of knapsack problem but also had to consider max and min power cases.
We have to maximise number of photographs taken also min distance needs to covered and max distance that can covered is also given. Power vector stands for power required to travel per distance. P stands for total power given. Photographs vector stands for number of photographs taken per distance.
I have tried to solve it using DP because greedy method is giving TLE. Link to code->https://ide.codingblocks.com/s/594565 Thanks in advance
