CCF 201909-1 小明种苹果(Python满分)

CCF 201909-1 小明种苹果(Python满分)

问题描述

代码实现

n,m = map(int,input().split())     

alist = []

final_count = 0
suguo_count = [[i+1,0] for i in range(n)] #创建疏果二维数组

def abs_sum(li):
    ab = 0
    for i in range(1,len(li)):
        ab += abs(li[i])
    return ab

for j in range(n):
    d = list(map(int,input().split()))
    suguo_count[j][1] = abs_sum(d)
    final_count += d[0]-suguo_count[j][1]


l = sorted(suguo_count,key = lambda x: (x[1],-x[0]))

print(final_count,l[n-1][0],l[n-1][1],end=' ')