老師很用心（也很幽默ＸＤ）～～辛苦了！不過作業都好難喔ＱＱ

import math

n = int(input())

p = int(input())

d = int(input())

#print(n, p, d)

TownInfor = []

for i in range(n):

TownInfor.append(input().split())

for j in range(3):

TownInfor[i][j] = int(TownInfor[i][j])

#print(TownInfor)

TownDst = []

for i in range(n):

TownDst.append([])

for j in range(n):

DstSquare = (TownInfor[i][0] - TownInfor[j][0]) ** 2 + (TownInfor[i][1] - TownInfor[j][1]) ** 2

TownDst[i].append(float("%.2f" % math.sqrt(DstSquare)))

#for EveryRowInTownDst in TownDst:

#print(EveryRowInTownDst)

NumBase = 0

TotalPopInThisArea = 0

TownPriority = []

TotalCoverPop = 0

for i in range(n):

TotalPopInThisArea += TownInfor[i][2]

while NumBase < p or TotalPopInThisArea < TotalCoverPop:

BestTown = 0

MaxSumOfPop = 0

for i in range(n):

SumOfPop = 0

for j in range(n):

if float(TownDst[i][j]) <= float(d):

SumOfPop += TownInfor[j][2]

if MaxSumOfPop < SumOfPop:

BestTown = i

MaxSumOfPop = SumOfPop

#print(BestTown, MaxSumOfPop)

TownPriority.append(BestTown + 1)

TotalCoverPop += MaxSumOfPop

for i in range(BestTown, BestTown + 1):

for j in range(n):

if float(TownDst[i][j]) <= float(d):

TownInfor[j][2] = 0

#print(TownInfor)

NumBase += 1

print(TownPriority, TotalCoverPop)

A good lectures

The course is useful. I enjoyed solving the practice quizzes, though it took a long time trying and debugging.