백준 5397번 C++

#include <iostream>
#include <string>
#include <stack>
#include <algorithm>

using namespace std;

int main(void) {
	int n;
	string s;

	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> s;
		stack<char> answer,cache;
		for (int j = 0; j < s.length(); j++) {
			if (s[j] == '<') {
				if (!answer.empty()) {
					cache.push(answer.top());
					answer.pop();
				}
			}
			else if (s[j] == '>') {
				if (!cache.empty()) {
					answer.push(cache.top());
					cache.pop();
				}
			}
			else if (s[j] == '-') {
				if (!answer.empty())
					answer.pop();
			}
			else 
				answer.push(s[j]);
		}
		while (!cache.empty()) {
			answer.push(cache.top());
			cache.pop();
		}
		string s;
		while (!answer.empty()) {
			s += answer.top();
			answer.pop();
		}
		reverse(s.begin(), s.end());
		cout << s << endl;
	}
	return 0;
}