STL模板栈、队列

栈模板stack()和队列模板queue()

#include<stack>
#include<iostream>
#include<queue>
#include<string>
//先进后出的规律
using namespace std;

class person
{
public:
	string m_name;
	int m_age;

	person(string name,int age)
	{
		this->m_age = age;
		this->m_name = name;
	}
};


int main(void)
{
	stack<int>p;
	queue<person> s;
	p.push(10);
	p.push(20);
	p.push(30);
	p.push(40);

	person p1("j",12);
	person p2("h",13);
	person p3("k",14);
	person p4("l",15);
	person p5("m",16);
	s.push(p1);
	s.push(p2);
	s.push(p3);
	s.push(p4);
	s.push(p5);

	while (!p.empty())
	{
		cout << p.top() << endl;
		p.pop();
	}

	while (!s.empty())
	{
		s.pop();
		cout<<s.front().m_age << endl;
		cout << s.front().m_name << endl;
	}
	return 0;
}