栈与队列调度

#include <bits/stdc++.h>
using namespace std;

int main() {
stack<int>s;queue<int>q;
for(int x:{1,2,3}){s.push(x);q.push(x);}
s.pop();q.pop();
cout<<s.top()<<" "<<q.front();
}

#include <bits/stdc++.h>
using namespace std;

int main() {
stack<int>s;queue<int>q;
for(int x:{1,2,3}){s.push(x);q.push(x);}
s.pop();q.pop();
cout<<s.top()<<" "<<q.front();
}