C++ 优先级队列（priority_queue）

// 使用VS2008 和 code::blocks 10.05调试通过
#include <iostream>
#include <queue>
using namespace std ;

int main()
{
    priority_queue<float> q;

    // insert three elements into the priority queue
    q.push (66.6);
    q.push (22.2);
    q.push (44.4);

    // read and print two elements
    cout << q.top () << ' ';
    q.pop ();
    cout << q.top () << endl;
    q.pop ();

    // insert three more elements
    q.push (11.1);
    q.push (55.5);
    q.push (33.3);

    // skip one element
    q.pop ();

    // pop and print remaining elements
    while (!q.empty ()) {
        cout << q.top () << ' ';
        q.pop ();
    }
    cout << endl ;
}