C++的STL中队列（queue）的使用说明

#include <iostream>
#include <queue>
using namespace std;
struct cmp
{
	bool operator()(const int a, const int b)
	{
		return a>b;
	}
};

/

也可以这样做

class cmp
{
public:
	bool operator()(const int a, const int b)
	{
		return a>b;
	}
};

/
int main()
{
	priority_queue <int,vector<int>,cmp>q1;
	priority_queue <int, vector<int>>q2;
	int a[] = { 1, 3, 4, 2, 5, 0, 6 };
	for (int i = 0; i<7; i++)
	{
		q1.push(a[i]);
		q2.push(a[i]);
	}
	while (q1.empty() != 1)
	{
		cout << q1.top() << " ";
		q1.pop();
	}
	cout << endl;
	while (q2.empty() != 1)
	{
		cout << q2.top() << " ";
		q2.pop();
	}
	cout << endl;
	system("pause");
	return 0;
}

运行结果