C++的priority_queue實現最大堆

最大堆在面試題和筆試題中常常見到,練習一下吧,總沒有壞處...

#include<stdio.h>
#include<queue>

using namespace std;

const int k = 10;

struct node
{
	int n;
	int weight;
};
typedef struct node Node;

//以權重weight的值建立最大堆
struct cmp
{
	bool operator()(const Node &a,const Node &b)
	{
		return a.weight < b.weight;
	}
};

priority_queue<Node, vector<Node>, cmp> priorityQueue;

void initQueue()
{
	for(int i=0; i<15; i++)
	{
		Node node;
		scanf("%d %d", &node.n, &node.weight);
		priorityQueue.push(node);
	}
	//Node n = priorityQueue.top();
	//printf("%d %d\n", n.n, n.weight);
}
//取出k個元素
void getMembers(int k)
{
	while(k--)
	{
		Node node = priorityQueue.top();
		priorityQueue.pop();
		printf("%d %d\n", node.n, node.weight);
	}
}

int main()
{
	initQueue();
	getMembers(10);
	return 0;
}