Expedi problem (greedy algorithms)

#1

i am unable to do this problem. pls tell the code.

#2

hi @yutikakhanna

You can apply greedy algorithm to sort all fuel stops on the basis of the fuel quantity that they provide in descending order. Then loop through it and whenever the total fuel becomes >= the total distance, print the number of stops.

Code : https://ide.codingblocks.com/s/201393

hope it helps.

#3

@yutikakhanna
Please mark your doubt as solved.

#4

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.