猫史档案馆

话不多说

上die码

#include<iostream>
using namespace std;
const int MAXN=101;
int a1[MAXN],head1=0;//栈1
int a2[MAXN],head2=0;//栈2
void push(int n){//入队
    if(head1>=MAXN-1){//栈1已满
        cout<<"队列已满！"<<endl;
    }else{
        a1[head1]=n;
        head1++;
    }
}
void pop(){//出队
    if(head1==0&&head2==0){
        cout<<"队列里没有任何数！"<<endl;
    }else if(head2==0){
        head2=head1;
        for(int i=0;i<=head1-1;i++){
	    a2[i]=a1[head1-i-1];
	}
        head1=0;
        head2--;
        cout<<a2[head2]<<endl;
    }else{
        head2--;
        cout<<a2[head2]<<endl;
    }
}
int main(){
    push(11);
    push(45);
    pop();
    push(14);
    pop();
    pop();
    return 0;
}