Envío 4778

Código

from heapq import heappush, heappop, heappushpop
def rooms(times):
    times.sort()
    h = []
    res = 0

    for s, e in times:
        res = max(res, len(h))
        while h and h[0] <= s:
            heappop(h)
        heappush(h, e)
    return max(res, len(h))

def hour_to_mins(s):
    h, m = s.split(":")
    return 60 * int(h) + int(m)


if __name__ == "__main__":
    N = int(input())
    times = []
    for _ in range(N):
        sh, eh = input().split(" ")
        s = hour_to_mins(sh)
        e = hour_to_mins(eh)
        times.append((s, e))
    print(rooms(times))