python排序函数sort

from functools import cmp_to_key
def comp(x,y):
    if x[2]>y[2]:
        return 1
    elif x[2]<y[2]:
        return -1
    else:
        return 0
n=int(input())
stu=[]
for i in range(n):
    a,b,c=input().split()
    c=int(c)
    stu.append((a,b,c))
#stu.sort(key=lambda k:k[2],reverse=True)
stu.sort(key=cmp_to_key(comp),reverse=True)
print(stu[0][0],stu[0][1])
print(stu[n-1][0],stu[n-1][1])