代码

// 鸭子排队: build a min-heap-ordered arrangement of the given numbers.
// Any arrangement with a[i/2] <= a[i] (1-indexed) is legal; sorting ascending works.
#include <stdio.h>
#include <algorithm>
static unsigned a[100005];
int main() {
    size_t n = fread(a, 4, 100005, stdin);
    unsigned cnt = a[0];
    std::sort(a + 1, a + 1 + cnt);
    fwrite(a + 1, 4, cnt, stdout);
    return 0;
}

评测结果