Hello

k_clostest.py

import math

# distance formula
def distance(us, vs):
    sum = 0
    # enumerate over all xs and ys together
    for (x, y) in zip(us, vs):
        sum += (x-y) ** 2
    return math.sqrt(sum)

# find the k(th) closest location from the place
def k_closest(place, k, location):

    # calculate all distance and add it into list
    list = []
    for loc in location:
        list.append([distance(place, loc[1:]), loc[0]])
        
    # get the closest element up to k, then exit
    outcome = []
    for item in sorted(list):
        if len(outcome) < k:
            outcome.append(item[1])
        else:
            break

    return outcome