Wrong answer coming

#1

please tell the problem in the code

#2

Hey Akshita, use long long int to avoid overflow!
rest code is fine.
FollowUP (can you solve this in O(n) complexity instead of O(NlogN)?)

#3

is the complexity O(nlogn) beacuse of priority queue? i can use an integer in it’s place to store the minimum value

#4

another thing, after declaring cost as long long int it still gave wrong answer. the arrays storing cost and petrol also had to be made long long int, what is the reason?

#5

exactly! so no need to maintain a priority queue.

#6

This is because when you multiply pq.top() and l[i], the result which is in integer already overflows! hence both of them must be long long as well.

#7

okay thank you .