Greedy5 [python] 체육복 문제 출처 체육복 풀이 def solution(n, lost, reserve): take = [0 if i in lost else 1 for i in range(n+1)] idx = 0 while idx < len(reserve): if take[reserve[idx]] == 0: take[reserve.pop(idx)] = 1 else: idx += 1 heap = (-1, 1) for i in reserve: for j in heap: if 0 < i+j 2019. 9. 6. 이전 1 2 다음
