题解 | #输入整型数组和排序标识，升序或降序进行排序#

方法一：
n=int(input())
alist =[int(i) for i in input().split()] 
reverse = False if int(input())==0 else True

alist.sort(reverse=reverse)
for i in range(n):    
    print(alist[i],end=" ")
	
方法二：
def my_sort(n, alist, reverse):
    if reverse == False:
        for i in range(n - 1):
            for j in range(0, n - i - 1):
                if alist[j] > alist[j + 1]:
                    alist[j], alist[j + 1] = alist[j + 1], alist[j]
    else:
        for i in range(n - 1):
            for j in range(0, n - i - 1):
                if alist[j] < alist[j + 1]:
                    alist[j], alist[j + 1] = alist[j + 1], alist[j]


n = int(input())
alist = [int(i) for i in input().split()]
reverse = False if int(input()) == 0 else True
my_sort(n, alist, reverse)
for a in alist:
    print(a,end=' ')