I'm trying the problem: 1923D - Slimes

Problem Summary: an element a -> a can take the adjacent element b if b is strictly less than a. After taking b, a is increased by b and b is removed. For an element, what is the min number of operations need among all other elements to take the element?

Approach: Prefix Sum + Binary Search

Calculate prefix and binary search on the right side to find the closest index where the sum is greater than the curr element. Then reverse the array and do it again (to search on the left side). Note: there must at least two unique element which is handled by map.

Submission: 284865983

What's wrong in my code?

Can anyone please help me to debug?