1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19

from heapq import heappop, heappush

def solution(n, m, section):
    answer = 0
    arr = []
    for x in section:
        heappush(arr,x)
    idx = heappop(arr)
    end = idx + m -1
    cnt = 1
    while arr:
        if arr[0] <= end:
            heappop(arr)
            continue
        else:
            idx = heappop(arr)
            end = idx + m -1
            cnt += 1
    return cnt