python实现代码
#小明种苹果
#N:苹果树的棵树; M:梳果操作的轮数
N, M = map(int, input("请输入N,M:").split())
dicts = {} #键为苹果树编号,值为梳果个数
sums = 0 #初始的苹果总数
deletes = 0 #总疏果数
for i in range(1, N+1):
stree = [int(m) for m in input("请输入第i棵树的情况:").split()]
#第i棵树的梳果个数
delete = -sum(stree[1:]) #注意函数和变量不能重名
dicts[i] = delete
deletes += delete
sums += stree[0]
#T:最后一轮疏果操作后所有苹果树上剩下的苹果总数
T = sums - deletes
sorted_dicts = sorted(dicts.items(), key = lambda x:x[1], reverse=True)
print(sorted_dicts)
#k:疏果个数最多的苹果树编号
k = sorted_dicts[0][0]
#P:对应的疏果个数
P = sorted_dicts[0][1]
print("%d %d %d" %(T,k,P))