Leetcode 2659. Make Array Empty

Given a distinct integer array, repeatedly either remove the first element if it is the current minimum or move it to the end, and return the total number of operations to empty the array. The core challenge is to count removals and rotations efficiently by processing elements in increasing value order and tracking how deletions shift indices (e.g., with an order-statistics structure) to avoid quadratic simulation.