Python | Two pointer | Easy
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 maximizeGreatness(self, nums: List[int]) -> int:
        
        n  = len(nums)
        ans = 0

        nums.sort()

        i = 0
        j = 0

        while i < n and j < n:

            if nums[i] < nums[j]:
                ans += 1
                i += 1
                j += 1

            else:
                j += 1

        return ans
```
['Python3']