27 кластеры A

#https://inf-ege.sdamgia.ru/problem?id=70554 файл A
from math import dist
data = open("demo_2025_27_A.txt").readlines()[1:]
n = len(data)
for i in range(n):
    data[i] = list(map(float, data[i].replace(',', '.').split()))
print(data)
answ = ((-1, -1), (-1, -1))
rst = 10000000000
for c1 in range(n):
    for c2 in range(c1 + 1, n):
        cur = 0
        for x in range(n):
            cur_x = min(dist(data[x], data[c1]), dist(data[x], data[c2]))
            cur += cur_x
        if cur < rst:
            rst = cur
            answ = (data[c1], data[c2])
print(int(((answ[0][0] + answ[1][0]) / 2) * 10000), int(((answ[0][1] + answ[1][1]) / 2) * 10000))