C++ priority_queue用法（大顶堆，小顶堆）-白红宇

C++ priority_queue用法（大顶堆，小顶堆）

阅读量：6913 次

发布时间：2019-06-27

本文共 1501 字，大约阅读时间需要 5 分钟。

template <class T, class Container = vector<T>, 
 class Compare = less<typename Container::value_type> > class priority_queue;

parameters

例子

#include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         #include 
          
           #include 
           
            #include 
            
             using namespace std;/** 默认比较函数为less, 大顶堆 **/void defaultCmpLess() { cout << "=========defaultCmpLess(big heap)========" << endl; priority_queue
             
               q; for (int i = 0; i < 10; i++) { q.push(rand()%20); } while (!q.empty()) { cout << q.top() << " "; q.pop(); } cout <
              
               << endl; priority_queue

, greater

> q; for (int i = 0; i < 10; i++) { q.push(rand()%20); } while (!q.empty()) { cout << q.top() << " "; q.pop(); } cout <

b.y;}/** 运算符重载 **/void overloadOperator() { cout << "=========overload Operator< =========" << endl; cout << "a.x < b.x; a.y > b.y" << endl; priority_queue

q; for (int i = 0; i < 10; i++) { q.push( Node( rand()%20, rand()%20 ) ); } while (!q.empty()) { cout << q.top().x << "," << q.top().y << endl; q.pop(); } cout << endl; }//=========================/** 自构建比较函数 **/struct cmp2{ bool operator()(int a, int b) { return a < b; }};void designCmp() { cout << "=========designCmp========" << endl; cout << "operator a

<< endl; priority_queue

, cmp2 > q; for (int i = 0; i < 10; i++) { q.push(rand()%20); } while (!q.empty()) { cout << q.top() << " "; q.pop(); } cout <

b.y 19,1 19,9 19,18 17,6 16,15 12,7 10,13 9,17 3,9 0,13 =========designCmp======== operator a

转载于:https://my.oschina.net/Jerrymingzj/blog/803829