#include <stack>

 template <typename T>

 class CStkQueue

 {

 public:

   T      queuePop();          //出队列

   void   queuePush(T value);  //入队列

   size_t queueSize();         //队列长度

   bool   queueEmpty();        //队列判空

 private:

   std::stack<T> std_stack_push;  //入栈,模拟队尾

   std::stack<T> std_stack_pop;   //出栈,模拟队首

 };

 template <typename T>

 T CStkQueue<T>::queuePop()

 {

   T temp;  //返回值

   //如果出栈不为空,直接将出栈的栈顶元素弹出

   if (!std_stack_pop.empty())

   {

     temp = std_stack_pop.top();

     std_stack_pop.pop();

     return temp;

   }

   //将入栈元素弹出并压进出栈至仅剩一个元素

   while (std_stack_push.size() != )

   {

     std_stack_pop.push(std_stack_push.top());

     std_stack_push.pop();

   }

   //将入栈仅有的一个元素作为返回值弹出

   temp = std_stack_push.top();

   std_stack_push.pop();

   return temp;

 }

 template <typename T>

 void CStkQueue<T>::queuePush(T value)

 {

   //如果出栈不为空,先将出栈元素弹回入栈

   while (!std_stack_pop.empty())

   {

     std_stack_push.push(std_stack_pop.top());

     std_stack_pop.pop();

   }

   //元素压栈

   std_stack_push.push(value);

 }

 template <typename T>

 size_t CStkQueue<T>::queueSize()

 {

   return (std_stack_push.size() + std_stack_pop.size());

 }

 template <typename T>

 bool CStkQueue<T>::queueEmpty()

 {

   return ((std_stack_push.size() + std_stack_pop.size()) == ) ? true : false;

 }