it's work
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def minimumPairRemoval(self, nums: List[int]) -> int:
        operation = 0

        def is_non_decreasing(arr):
            return all(arr[i] <= arr[i + 1] for i in range(len(arr) - 1))


        while not is_non_decreasing(nums):

            # find pair with min sum and left most index
            min_sum = float('inf')
            min_idx = 0
            for i in range(len(nums) - 1):
                pair = nums[i] + nums[i + 1]

                if pair < min_sum:
                    min_sum = pair
                    min_idx = i

            merged = nums[min_idx]  + nums[min_idx + 1]
            nums = nums[:min_idx] + [merged] + nums[min_idx + 2:]
            operation += 1

        return operation
            
```
['Greedy', 'Simulation', 'Python3']