# 蓝桥杯
# 答疑
# 贪心策略
# 按总时间从小到大排序
# 同学数量
n = int(input())
stu = [[0]*5 for _ in range(n)]
for i in range(n):
s, a, e = input().split()
s = int(s)
a = int(a)
e = int(e)
stu[i][0] = s
stu[i][1] = a
stu[i][2] = e
stu[i][3] = s+a
stu[i][4] = s+a+e
# 按照stu[i][4]的值对二维列表进行排序
stu = sorted(stu, key=lambda x: x[4])
sum = stu[0][3]
time = stu[0][3]
for j in range(1, n):
time = time+stu[j-1][2]+stu[j][3]
sum += time
print(sum)
答疑顺序(蓝桥杯题目Python)
最新推荐文章于 2024-07-17 09:15:39 发布