# 1338. Reduce Array Size to The Half

You are given an integer 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 a 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.

Constraints:

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

``````class Solution {
public:
int minSetSize(vector<int>& arr) {
int n = arr.size(), half = n / 2, res = 0, cnt = 0;
vector<int> cntArr;
unordered_map<int, int> numCnt;
for (int num : arr) {
++numCnt[num];
}
for (auto &a : numCnt) {
cntArr.push_back(a.second);
}
sort(cntArr.rbegin(), cntArr.rend());
for (int i = 0; i < cntArr.size(); ++i) {
cnt += cntArr[i];
if (cnt >= half) return i + 1;
}
return -1;
}
};
``````

``````class Solution {
public:
int minSetSize(vector<int>& arr) {
int n = arr.size(), cnt = 0, res = 0;
priority_queue<int> pq;
unordered_map<int, int> numCnt;
for (int num : arr) ++numCnt[num];
for (auto a : numCnt) {
pq.push(a.second);
}
while (!pq.empty()) {
++res;
cnt += pq.top(); pq.pop();
if (cnt >= n / 2) break;
}
return res;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1338

https://leetcode.com/problems/reduce-array-size-to-the-half/

https://leetcode.com/problems/reduce-array-size-to-the-half/solutions/1319470/c-simple-and-clean-solution-explained-easy-to-understand/

https://leetcode.com/problems/reduce-array-size-to-the-half/solutions/1319416/c-java-python-hashmap-sort-then-counting-sort-o-n-clean-concise/

LeetCode All in One 题目讲解汇总(持续更新中…)

（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，快快加入吧～）

|

Venmo 打赏

—|—

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation