代码

#include <algorithm>
#include <cstdio>

#define re register int
typedef unsigned int uint;
const int maxn = 1e5 + 1;
uint a[maxn]; int n;

inline void down(const int& x) {
	re 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 (i == j) break;
		a[i] ^= a[j] ^= a[i] ^= a[j], i = j;
	}
}

int main() {
	fread(a, 1, maxn << 2, stdin);
	n = a[0];
	for (re i = n >> 1; i; down(i--));
	fwrite(a + 1, 1, n << 2, stdout);
	return 0;
}

评测结果