C++ 알고리즘 - 24511 queuestack

https://www.acmicpc.net/problem/24511

 

#include <bits/stdc++.h>
#define endl "\n"

using namespace std;

int qs[100002];

void CPP_INIT() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
}

int main(void) {
	CPP_INIT();

	int input1, input2;
	int num;
	int result;
	deque<int> dq;

	cin >> input1;

	for (int i = 0; i < input1; i++) {
		cin >> num;
		qs[i] = num;
	}

	for (int i = 0; i < input1; i++) {
		cin >> num;
		if (qs[i] == 0)
			dq.push_back(num);
	}

	cin >> input2;
	
	for (int i = 0; i < input2; i++) {
		cin >> num;

		dq.push_front(num);
		cout << dq.back() << " ";
		dq.pop_back();
	}
}