代码

# include <bits/stdc++.h>
# define N 10010
std::priority_queue< unsigned,std::vector<unsigned>,std::greater<unsigned> > mt;
void sort(unsigned *a,int n) {
	int i;
	for(i=0;i<n;i++) mt.push(a[i]);
	for(i=0;i<n;i++) a[i]=mt.top(), mt.pop(); 
}

评测结果