Easy Java solution, Sorting
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int maximizeGreatness(int[] nums) {\n        int left = 0;\n        int right = 1;\n        int counter = 0;\n        \n        Arrays.sort(nums);\n        \n        while(right < nums.length) {\n            if(nums[left] != nums[right]) {\n                counter++;\n                left++;\n            }\n            right++;\n        }\n        return counter;\n    }\n}\n```
['Sorting', 'Java']