Create Sorted Array through Minimum Cost Insertion
You are given an integer array
instructions. You need to build a sorted collection by inserting elements from instructions one by one in the given order. The cost of inserting an element instructions[i] into the current collection is defined as the minimum of: The number of elements currently in the collection that are strictly less than instructions[i]. The number of elements currently in the collection that are strictly greater than instructions[i]. Calculate the total cost of inserting all elements from instructions. Since the total cost can be very large, return the result modulo 10^9 + 7. Constraints: 1 <= instructions.length <= 10^5 1 <= instructions[i] <= 10^5JavaFenwick TreePrefix Sum
00