模板：优先队列(priority_queue)

#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

struct node
{
    int priortity;
    int value;

    friend bool operator<(node n1,node n2)
    {
        return n1.priortity < n2.priortity; // < 从大到小 ， > 从小到大
    }
};

int main()
{
    const int len = 5;
    int i;
    int a[len] = {3,5,9,6,2};

    //example 1:
    priority_queue<int> qi;

    for(i = 0; i < len; ++i)
    {
        qi.push(a[i]);
    }


    for(i = 0; i < len; ++i)
    {
        cout << qi.top() << endl;
        qi.pop();
    }

    //example 2:
    priority_queue<int,vector<int>,greater<int> > qi2; // greater从小到大，less从大到小

    for(i = 0; i < len; ++i)
    {
        qi2.push(a[i]);
    }

    for(i = 0; i < len; ++i)
    {
        cout << qi2.top() << endl;
        qi2.pop();
    }

    //example 3:
    priority_queue<node> qn;
    node b[len];
    b[0].priortity = 6; b[0].value = 1;
    b[1].priortity = 1; b[1].value = 5;
    b[2].priortity = 2; b[2].value = 3;
    b[3].priortity = 8; b[3].value = 2;
    b[4].priortity = 1; b[4].value = 4;

    for(i = 0; i < len; ++i)
    {
        qn.push(b[i]);
    }

    for(i = 0; i < len; ++i)
    {
        cout << qn.top().priortity << "	" << qn.top().value << endl;
        qn.pop();
    }

    return 0;
}

参考文献:

http://wenku.baidu.com/link?url=_Y5TTAR5M4O2Eakp3lckzhc9ZkvGKp0Bqk-iSgxzUQOL5kuxGwwLZlFO1cq4ZqqvJV1HoNgurOftPRJvKp9Ng3S83c43tS1tQp0jxFHBp-u