1040 As Easy As A+B

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

int main()
{
	int t;
	vector<int> v;
	while (cin >> t)
	{
		int n;
		while (t--&&cin >> n)
		{
			int val;
			while (n--&&cin >> val)
				v.push_back(val);
			sort(v.begin(), v.end());//泛型算法sort
			for (int i = 0; i < v.size() - 1; ++i)
				cout << v[i] << ' ';
			cout << v[v.size() - 1] << endl;
			v.clear();
		}
	}
}