优先队列

#include<iostream>
#include<cstdio>
#include<queue>
#include<functional>
using namespace std;
int main()
{
int N;
cin >> N;
while (N--)
{
priority_queue<int, vector<int>, greater<int>> P;
int n; cin >> n;
for (int i = 0; i < n; i++)
{
int m; cin >> m;
P.push(m);
}
for (int i = 0; i < n; i++)
{
if (i == n - 1) cout << P.top() << endl;
else cout << P.top() << ' ';
P.pop();
}
}
return 0;
}