代码

#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#define uint unsigned int
using namespace std;
priority_queue<uint, vector<uint>, greater<uint> > q;
void sort(uint *a, int n) {
	for (register int i = 0; i < n; ++i)	q.push(a[i]);
	for (register int i = 0; i < n; ++i)	a[i] = q.top(), q.pop();
}

评测结果