C++ 容器和库函数的使用

sort

sort(a,a+20);

priority_queue

class mpair
{
	public :
	int id,w;
	public :
		mpair(int a,int b)
		{
			id=a;w=b;
		}
		bool operator <( const mpair & b) const //在优先队列中从小到大 
		{
			return w>b.w;
		}
}; 

priority_queue<mpair> q;
priority_queue<int> q;//从大到小
等于priority_queue<int, vector<int>, less<int> > a;


q.push(mpair(u,0));
pop()
top()
size()
empty()

stack

stack<int> stk;
push()
top()
pop()
size()
empty()

queue

	queue<int> q;
	q.push(1);
	q.pop();
	q.front(); 
	q.size();
	q.empty();