Submission #1269360

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269360		PagodePaiva	Swap (BOI16_swap)	Pypy 3	0 / 100	135 ms	48776 KiB

swap

import sys
data = sys.stdin.read().split()
n = int(data[0])
# use 1-based indexing for convenience
a = [0] + list(map(int, data[1:]))

# process rounds 2..n: at round i we may swap bowl i with its parent floor(i/2)
for i in range(2, n+1):
    p = i // 2
    # if child has fewer candies than parent, swap to improve lexicographic order
    if a[i] < a[p]:
        a[i], a[p] = a[p], a[i]

# output the lexicographically minimal sequence
print(*a[1:])

Compilation message (stdout)

Compiling 'swap.py'...

=======
  adding: __main__.pyc (deflated 22%)

=======

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 27
• Subtask 4: 0 / 20
• Subtask 5: 0 / 32