代码

#include<queue>
std::priority_queue<int> q;
void sort(unsigned *a, int n)
{
	for (int i = 0; i < n; i ++) q.push(a[i]);
	for (int i = 0; i < n; i ++)
	{
		a[i] = q.top();
		q.pop();
	}
}

评测结果