HJ score ranking

Knowledge point : Sort

describe
Give some information about students （ name , achievement ） Sequence , Please rank their information from high to low or from low to high , Same score
All are processed according to the rules entered first and arranged first .

Example ：
jack 70
peter 96
Tom 70
smith 67

From high to low achievement
peter 96
jack 70
Tom 70
smith 67

From low to high
smith 67
jack 70
Tom 70
peter 96

notes ：0 Represents from high to low ,1 Represents from low to high

Data range ： The number of ：1\le n \le 200\1≤n≤200
Advanced ： Time complexity ：O(nlogn)\O(nlogn) , Spatial complexity ：O(n)\O(n)

Input description ：
In the first line, enter the number of people to sort n, In the second line, enter an integer to indicate the sorting method , after n Enter their names and grades on each line , Separated by a space

Output description ：
Output the name and grade in the specified way , Name and grade are separated by a space

Example 1

 Input ：3
      0
      fang 90
      yang 50
      ning 70

 Output ：fang 90
      ning 70
      yang 50

Example 2

 Input ：3
      1
      fang 90
      yang 50
      ning 70

 Output ：
      yang 50
      ning 70
      fang 90

Cattle guest HJ Python

#  The elapsed time 44ms  Take up memory 4648KB
n = int(input())
t = int(input())

l = []
for i in range(n):
    name,score = input().split()
    l.append((name, int(score)))
    
if t == 1:
    l.sort(key=lambda x:x[1], reverse=False)
else:
    l.sort(key=lambda x:x[1], reverse=True)

for i in l:
    print(i[0],i[1])

Link to the original text ：
https://www.920vip.net/article/180