代码

#include<stdio.h>
#include<algorithm>
#define MAXN 100001

unsigned a[MAXN];
int n;

void down(int x){
	int i=x,j;
	while (i<<1<=n){
		j=i; if (a[i<<1]<a[i])j=i<<1;
		if ((i<<1)+1<=n&&a[(i<<1)+1]<a[j])j=(i<<1)+1;
		if (j==i)break;
		std::swap(a[i],a[j]); i=j;
	}
}

int main() {
	fread(a, 1, MAXN * 4, stdin);
	n = a[0];
	
	// Rearrange the ducks a[1] .. a[n] here
	//std::sort(a + 1, a + n + 1);  // ha?
	for (int i=n/2;i;--i)down(i);
	fwrite(a + 1, 1, n * 4, stdout);
	return 0;
}

评测结果