2659. Make Array Empty

Hard

50 Points

Array

Binary Search

Greedy

Binary Indexed Tree

Segment Tree

Sorting

Ordered Set

You are given an integer array nums containing distinct numbers, and you can perform the following operations until the array is empty: Return an integer denoting the number of operations it takes to make nums empty.

Examples

Example 1

Input: nums = [3,4,-1] Output: 5

Example 2

Input: nums = [1,2,4,3] Output: 5

Example 3

Input: nums = [1,2,3] Output: 3

Constraints

1 <= nums.length <= 105
-109 <= nums[i] <= 109
All values in nums are distinct.