代码

# include <bits/stdc++.h>
# define N 10010
struct pair{
	unsigned x,y;
};
std::priority_queue<pair> mt;
bool operator <(const pair &i,const pair &j) {return i.x>j.x;}
void sort(unsigned *a,int n) {
	int i;
	srand(666);
	for(i=0;i<n;i++) mt.push((pair){a[i],rand()});
	for(i=0;i<n;i++) a[i]=mt.top().x, mt.pop(); 
}

评测结果