algorithmStudy/BJ18310.py at main · KeonhoPark/algorithmStudy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
import sys

n = int(sys.stdin.readline())
house = list(map(int, sys.stdin.readline().split()))
house.sort()
res = [0 for _ in range(n)]

if n == 1 or n == 2:
    print(house[0])

else:
    mid = (n // 2) - 1
    m = 0
    res = mid
    for i in range(n):
        m += abs(house[mid] - house[i])

    for i in range(mid + 1, n):
        tmp = 0
        for j in range(n):
            tmp += abs(house[i] - house[j])

        if m <= tmp:
            break
        else:
            m = tmp
            res = i

    for i in range(mid - 1, 0, -1):
        tmp = 0
        for j in range(n):
            tmp += abs(house[i] - house[j])

        if m <= tmp:
            break
        else:
            m = tmp
            res = i

    print(house[res])