查找最小的K的元素
方法一:利用最大堆
- 堆的大小为K,一次遍历整个数组,向最大堆插入元素。若当前元素小于最大堆的栈顶,则替换该栈顶,重新调整堆,否则继续遍历。
#include <iostream>
#include <vector>
#include <set>
using namespace std;
//注意:在申明MaxIntHeap类型时,greater<int>与>之间必须要有一个空格,否则编译器会报错!
typedef multiset<int, greater<int> > MaxIntHeap;
void findMinKElement(vector<int> &data, MaxIntHeap& leastNumbers,
unsigned int k)
{
if (data.size() <= 0 || k <= 0) {
cout << "Error input" << endl;
return;
}
leastNumbers.clear();
for (vector<int>::iterator iter = data.begin(); iter != data.end(); iter++) {
if (leastNumbers.size() < k) {
leastNumbers.insert(*iter);
} else {
MaxIntHeap::iterator i