16-03-03-2.cpp

more efftive 代码

#include <iostream>
#include <queue>
#include <cassert>
using namespace std;

int main() {
  priority_queue<int, vector<int>, greater<int> > Q;
  Q.push(1);
  Q.push(4);
  Q.push(2);
  Q.push(8);
  Q.push(5);
  Q.push(7);
  
  assert(Q.size() == 6);
  while (!Q.empty()) {
    cout << Q.top() << " ";
    Q.pop();
  }
  cout << endl;
  //  块