模板：优先队列(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 = ;
     int i;
     int a[len] = {,,,,};

     //example 1:
     priority_queue<int> qi;

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

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

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

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

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

     //example 3:
     priority_queue<node> qn;
     node b[len];
     b[].priortity = ; b[].value = ;
     b[].priortity = ; b[].value = ;
     b[].priortity = ; b[].value = ;
     b[].priortity = ; b[].value = ;
     b[].priortity = ; b[].value = ;

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

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

     return ;
 }

参考文献:

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