leetcode

0 const auto _ = []() {

1 ios_base::sync_with_stdio(0);

2 cout.tie(NULL);

3 cin.tie(NULL);

4 return NULL;

5 }();

6

7 // O(nlogn)

8 class Solution {

9 public:

10 int maximizeGreatness(vector<int> &nums) const {

11 sort(rbegin(nums), rend(nums));

12

13 int res = 0;

14 for (int i = 0; i < size(nums); i++) {

15 if (nums[i] < nums[res]) res++;

16 }

17

18 return res;

19 }

20 };

21

22 // O(n)

23 class Solution {

24 public:

25 int maximizeGreatness(const vector<int> &nums) const {

26 unordered_map<int, int> count;

27 int res = 0;

28 for (const int n : nums)

29 res = max(res, ++count[n]);

30 return size(nums) - res;

31 }

32 };