其实很简单,但是本人刚接触Python,对Python还很陌生,所以就实现起来还是遇到了困难,主要是排序那块。
版本一,直接用sort()方法就好了,Python排序的内部实现是稳定的,因此相对顺序不会变。
class Student(object):
def __init__(self, name=None, scores=0, order=0, m=0):
self.name = name
self.scores = scores
self.order = order
self.method = m
while True: # while True: try ... except: break,是用来输入多个样例的
try:
n = int(input())
m = int(input())
students = []
for i in range(n):
line = input().split()
students.append(Student(line[0], int(line[1]), i, m))
if m == 0:
students.sort(key=lambda stu: -stu.scores) # -stu.scores表示逆序(从大到小)
else:
students.sort(key=lambda stu: stu.scores)
for student in students:
print(student.name+" "+str(student.scores))
except:
break
版本二,借助functools中的cmp_to_key,自定义一个比较函数,将它传给cmp_to_key。
from functools import cmp_to_key
class Student(object):
def __init__(self, name=None, scores=0, order=0):
self.name = name
self.scores = scores
self.order = order
def cmp(stu1, stu2):
if stu1.scores > stu2.scores:
return -1 # -1表示排在前,因为python原本是从小到大排序的,-1表示小,所以-1 -> 在前面。
elif stu1.scores == stu2.scores:
return -1 if stu1.order < stu2.order else 1
else:
return 1
while True:
try:
n = int(input())
m = int(input())
students = []
for i in range(n):
line = input().split()
students.append(Student(line[0], int(line[1]), i))
if m == 0:
students.sort(key=cmp_to_key(cmp)) # 记得cmp后面不要(),这里是个引用
else:
students.sort(key=lambda stu: stu.scores)
for student in students:
print(student.name+" "+str(student.scores))
except:
break