python 看这

import sys
def quicksort(nums, l, r):
    if l < r:
        left,right  = l-1,r+1
        tmpVal = nums[(l+r)//2]
        while left < right:
            while True:
                left += 1
                if nums[left] >= tmpVal:
                    break
            while True:
                right -= 1
                if nums[right] <= tmpVal:
                    break
            if left<right:
                nums[left],nums[right] = nums[right],nums[left]
        quicksort(nums, l, right)
        quicksort(nums, right+1, r)
nums = []
for line in sys.stdin:
    nums.append(list(map(int, line.split())))
num = nums[1]
quicksort(num,0,len(num)-1)
print(" ".join(map(str,num)))