Java Solution
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
```java []
class Solution {
    public int minimumPairRemoval(int[] nums) {
        boolean inc= false;
        List<Integer> li= new ArrayList<>();
        for(int i: nums){
             li.add(i);
        }
        int count=0;
        while(!inc){
            inc= true;
            int min= Integer.MAX_VALUE;
            int ind=0;
            for(int i=0;i<li.size()-1;i++){
                int sum= li.get(i) + li.get(i+1);
                if(sum< min){
                    min= sum;
                    ind= i;
                }
                if(li.get(i)> li.get(i+1) ){
                   inc= false;
                }
            }
            if(inc) break;
            else{
                count++;
                li.set(ind, min);
                li.remove(ind+1);
            }
        }
        return count;
    }
}
```
['Java']