1 条题解
-
0
n, m = map(int, input().split()) features = {} test_cases = {} for i in range(n): v = int(input()) features[i+1] = v for j in range(m): priority = sum([features[_] for _ in list(map(int, input().split()))]) test_cases[j+1] = priority # sorted_keys = list(str(k) for k, v in sorted(order_count.items(), key=lambda item: item[1], reverse=True)) sorted_v = list(k for k, v in sorted(test_cases.items(), key=lambda item: item[1], reverse=True)) # print(sorted(test_cases.values(), key=lambda item: item, reverse=True)) for v in sorted_v: print(v)
- 1
信息
- ID
- 8
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 7
- 标签
- 递交数
- 201
- 已通过
- 48
- 上传者