#include<stdio.h>
#include<algorithm>
#include<queue>
using namespace std;
struct node{
int num;
node(int i){
num = i;
}
};
priority_queue<node>key;
bool operator <(node a ,node b){
return a.num<b.num;
}
int main(){
key.push(node(1));
key.push(node(4));
printf("%d\n",key.top().num);
key.pop();
key.push(node(2));
key.push(node(3));
printf("%d\n",key.top().num);
}
=============================================================================
struct compare {
bool operator()(const ListNode* l, const ListNode* r) {
return l->val > r->val;
}
};
ListNode *mergeKLists(vector<ListNode *> &lists) {
模板 - 优先队列
原文：http://www.cnblogs.com/clover-xuqi/p/7182289.html
