ROOM

优先队列#include<iostream> #include<cstdio> #include<algorithm> #include <cmath> #include <cstring> #include <string> #include<sstream> #include<set> #include <cstdlib> #include<map> #include<queue> #in

使用两个栈(stack)实现队列(queue)的基本功能template<class T> class my_Queue{ private: stack<T> s1,s2; public: void my_Push(T v){ s1.push(v); } T my_Front(){ if(s2.empty()){