1338. Reduce Array Size to The Half

最新推荐文章于 2021-07-07 12:42:34 发布

小白算法习题记录本

最新推荐文章于 2021-07-07 12:42:34 发布

阅读量148

点赞数

分类专栏： # 贪心算法

本文链接：https://blog.csdn.net/qq_43661234/article/details/105491295

版权

贪心算法专栏收录该内容

32 篇文章 0 订阅

订阅专栏

Reduce Array Size to The Half
Medium

111

Add to List

Share
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

class Solution {
public:
    int minSetSize(vector<int>& arr) {
        int n=arr.size();
        map<int,int>hash;
        for(int i=0;i<n;i++) hash[arr[i]]++;
        priority_queue<int>pq;//根据出现频率的大小建立大根堆
        for(auto a=hash.begin();a!=hash.end();a++)
            pq.push(a->second);
        
        int res=0,remove=0;
        while(!pq.empty()&&remove<n/2)
        {
            remove+=pq.top();
            pq.pop();
            res++;
        }
        return res;
    }
};