#include<iostream>#include<functional>#include<queue>using namespace std;struct node{    friend bool operator< (node n1, node n2)    {        return n1.priority < n2.priority;    }    int priority;    int value;};int main(){    const int len = 5;    int i;    int a[len] = {3,5,9,6,2};    //相对来说这个是很随意的建立了一个数组来保存运算的结果    //示例1    priority_queue<int> qi;    for(i = 0; i < len; i++)        qi.push(a[i]);                  //这是将所有的元素一个个的向队列里面填充    for(i = 0; i < len; i++)    {        cout<<qi.top()<<" ";        qi.pop();    }    cout<<endl;     //示例2    priority_queue<int, vector<int>, greater<int> >qi2;    for(i = 0; i < len; i++)        qi2.push(a[i]);    for(i = 0; i < len; i++)    {        cout<<qi2.top()<<" ";        qi2.pop();    }    cout<<endl;    //示例3    priority_queue<node> qn;    node b[len];    b[0].priority = 6; b[0].value = http://www.mamicode.com/1;    b[1].priority = 9; b[1].value = http://www.mamicode.com/5;    b[2].priority = 2; b[2].value = http://www.mamicode.com/3;    b[3].priority = 8; b[3].value = http://www.mamicode.com/2;    b[4].priority = 1; b[4].value = http://www.mamicode.com/4;    for(i = 0; i < len; i++)        qn.push(b[i]);    cout<<"优先级"<<‘\t‘<<"值"<<endl;    for(i = 0; i < len; i++)    {        cout<<qn.top().priority<<‘\t‘<<qn.top().value<<endl;        qn.pop();    }    return 0;}