1338. Reduce Array Size to The Half

Given an array `arr`.  You can choose a set of integers and remove all the occurrences of these integers in the array.

Return the minimum size of the set so that at least half of the integers of the array are removed.

Example 1:

```Input: arr = [3,3,3,3,5,5,5,2,2,7]
Output: 2
Explanation: Choosing {3,7} will make the new array [5,5,5,2,2] which has size 5 (i.e equal to half of the size of the old array).
Possible sets of size 2 are {3,5},{3,2},{5,2}.
Choosing set {2,7} is not possible as it will make the new array [3,3,3,3,5,5,5] which has size greater than half of the size of the old array.
```

Example 2:

```Input: arr = [7,7,7,7,7,7]
Output: 1
Explanation: The only possible set you can choose is {7}. This will make the new array empty.
```

Example 3:

```Input: arr = [1,9]
Output: 1
```

Example 4:

```Input: arr = [1000,1000,3,7]
Output: 1
```

Example 5:

```Input: arr = [1,2,3,4,5,6,7,8,9,10]
Output: 5
```

Constraints:

• `1 <= arr.length <= 10^5`
• `arr.length` is even.
• `1 <= arr[i] <= 10^5`

1338. Reduce Array Size to The Half
``````struct Solution;
use std::collections::BinaryHeap;
use std::collections::HashMap;

impl Solution {
fn min_set_size(arr: Vec<i32>) -> i32 {
let n = arr.len();
let mut hm: HashMap<i32, usize> = HashMap::new();
for x in arr {
*hm.entry(x).or_default() += 1;
}
let mut pq: BinaryHeap<usize> = BinaryHeap::new();
for (_, v) in hm {
pq.push(v);
}
let mut sum = 0;
let mut res = 0;
while sum * 2 < n {
sum += pq.pop().unwrap();
res += 1;
}
res
}
}

#[test]
fn test() {
let arr = vec![3, 3, 3, 3, 5, 5, 5, 2, 2, 7];
let res = 2;
assert_eq!(Solution::min_set_size(arr), res);
let arr = vec![7, 7, 7, 7, 7, 7];
let res = 1;
assert_eq!(Solution::min_set_size(arr), res);
let arr = vec![1, 9];
let res = 1;
assert_eq!(Solution::min_set_size(arr), res);
let arr = vec![1000, 1000, 3, 7];
let res = 1;
assert_eq!(Solution::min_set_size(arr), res);
let arr = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
let res = 5;
assert_eq!(Solution::min_set_size(arr), res);
}
``````