使用优先队列实现
#include <iostream>
#include <queue>
using namespace std;
int main()
{
int caseNum;
cin >> caseNum;
while(caseNum--)
{
priority_queue<int, vector<int>, greater<int> > q;//优先队列,优先级高的先pop
int n;
cin >> n;
for(int i = 0;i < n;i++)
{
int x;
cin >> x;
q.push(x);
}
while(!q.empty())
{
cout << q.top() << endl;
q.pop();
}
}
return 0;
}