W9_P4.cpp

#include <iostream>
#include <vector>
using namespace std;

class PriorityQueue {
private:
	vector<int>v;
public:
	bool empty() {
		if (v.size() == 0) {
			return 1;
		}
		return 0;
	}

	void push(int e) {
		if (empty()) {
			v.push_back(e);
		}
		else {

			for (auto i = v.begin(); i != v.end(); i++) {
				if (e > *i) {
					v.insert(i, e);
					return;
				}
			}
			v.insert(v.end(), e);
		}
	}

	int pop() {
		if (!empty()) {
			int value = v.front();
			v.erase(v.begin());
			return value;
		}
		else
		{
			return 0;
		}
	}
};

int main() {
	int t;
	cin >> t;
	while (t--) {
		int n;
		cin >> n;

		vector<int> v;
		PriorityQueue pq;

		for (int i = 0; i < n; i++) {
			int num;
			cin >> num;
			v.push_back(num);
		}

		for (int i = 0; i < n; i++) {
			pq.push(v.front());
			v.erase(v.begin());
		}

		for (int i = 0; i < n; i++) {
			v.push_back(pq.pop());
		}

		for (int i = 0; i < n; i++) {
			cout << v[i] << " ";
		}
		cout << "\n";
	}

	return 0;
}