by SW academy 😉 나의 풀이 def sel_min(): _min=0 minX, minY=0, 0 _min=arr[0][0] for i in range(5): for j in range(5): if _min > arr[i][j]: _min=arr[i][j] minX, minY=i, j arr[minX][minY]=26 return _min arr=[[9, 20, 2, 18, 11], [19, 1, 25, 3, 21], [8, 24, 10, 17, 7], [15, 4, 16, 5, 6], [12, 13, 22, 23, 14]] sorted_arr=[[0]*5 for _ in range(5)] cur_min=-1 newX, newY=0,0 dx=[1, 0, -1, 0] dy=[0, 1, 0, -1]..
