SIMPLE EASY APPROACH WITH BASIC IDEA USING PYTHON FUNCTIONS
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:
        count=0
        while nums!=[] and sorted(nums)!=nums:
            min_sum=float('inf')
            min_ind=-1
            for i in range(len(nums)-1):
                sum=nums[i]+nums[i+1]
                if(min_sum>nums[i]+nums[i+1]):
                    min_sum=sum
                    min_ind=i
            nums=nums[:min_ind]+[nums[min_ind]+nums[min_ind+1]]+nums[min_ind+2:]
            print(nums)
            count+=1
        return count
```
['Python3']