프로그래머스 - 호텔 대실 (L2)

 1import heapq
 2
 3def time_calc(time):
 4    time_split = time.split(':')
 5    return int(time_split[0])*60 + int(time_split[1])
 6
 7def solution(book_time):
 8    time = []
 9    q = []
10    for start, end in book_time:
11        time.append((time_calc(start), time_calc(end)))
12    time.sort(key=lambda x: x[0])
13    print (time)
14    for start, end in time:
15        if q:
16            top = heapq.heappop(q)
17            if top > start:
18                heapq.heappush(q, top)
19            heapq.heappush(q, end+10)
20        else:
21            heapq.heappush(q, end+10)
22    return len(q)