Blue Bridge Cup -- sequence sequencing problem

1. Problem description

Given a length of n Sequence of numbers , Arrange the sequence in descending order .1<=n<=200

2. Subject requirements

The first line is an integer n.
The second line contains n It's an integer , Is the number to be sorted , The absolute value of each integer is less than 10000.
Output one line , Output the sorted sequence in descending order .
The time limit ：1.0s Memory limit ：512.0MB

 for example : Input   5
	 	  8 6 5 9 1
	  Output   1 5 6 8 9

3. My answer

lst1=[]
n=int(input())
lst2=input().split(' ')
for i in range(n):
    lst1.append(int(lst2[i]))
lst1.sort()
for num in lst1:       
    print(num,end=' ')

sort() Function to sort the original list , The default is ascending

For specific usage, please refer to ： Novice tutorial ——python list sort()

4. matters needing attention

lst1=[]
n=int(input())
lst2=map(int,input().split())
for i in range(n):
    lst1.append(lst2[i])
lst1.sort()
for num in lst1:       
    print(num,end=' ')

If the above code runs , There will be a running error ：

TypeError: ‘map’ object is not subscriptable

indicate map() Function not subscript , So this question can't be used map() Function transform data type .