leetcode

0 class Solution {

1 public:

2 int minSetSize(vector<int> &arr) {

3 sort(begin(arr), end(arr));

4

5 vector<int> count;

6 int n = arr.size() / 2, crnt = 1, res = 0;

7 for (int i = 1; i < arr.size(); i++) {

8 if (arr[i] == arr[i - 1])

9 crnt++;

10 else {

11 count.push_back(crnt);

12 crnt = 1;

13 }

14 }

15

16 count.push_back(crnt);

17 sort(rbegin(count), rend(count));

18

19 for (int i = 0; n > 0; i++)

20 n -= count[i], res++;

21 return res;

22 }

23 };