代码

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <functional>
#define re register int
typedef unsigned int uint;
const int maxn = 1e5 + 1;
namespace judgeduck {
	extern char *stdin_content;
	extern int stdin_size;
	extern char *stdout_content;
	extern int stdout_size;
	extern int stdout_max_size;
}
	int n = *(int*)judgeduck::stdin_content;
#define a ((unsigned*)judgeduck::stdout_content-1)
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 _ = [](){
	using namespace judgeduck;
	memcpy(stdout_content, stdin_content+4, stdout_size = n<<2);
        for (re i = n >> 1; i; down(i--));
    asm volatile("int %0"::"i"(48),"a"(18)); // exit
return 0;}();
int main() {}

评测结果