C++ priority_queue 基本操作

#include<queue>
using namespace std;

int main(){
	priority_queue <int> a;
	priority_queue <double> b;
	priority_queue < int, vector <int>, greater <int> > c;
	priority_queue <int> d( a);
} 

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

int main(){
	priority_queue <int> a;
	a.push( 4);
	a.push( 1);
	a.push( 3);
	a.push( 2);
	
	//优先队列 默认less排序 队首为最大元素 
	cout << "a.top() is " << a.top() << endl;
	while( a.size() != 0){
		cout << "delete " << a.top() << endl;
		a.pop();
	}
	if( a.empty()) cout << "a is empty" << endl;
	
	//用greater后  b升序排列 队首为最小元素 
	priority_queue<int, vector<int>, greater<int> > b;
	b.push( 4);
	b.push( 1);
	b.push( 3);
	b.push( 2);
	cout << "b.top() is " << b.top() << endl;
	while( b.size() != 0){
		cout << "delete " << b.top() << endl;
		b.pop();
	} 
	if( b.empty()) cout << "b is empty" << endl;
	
}