[백준 알고리즘] 1931번 회의실배정(Python)

 

<Python>

import sys

N = int(input())
meeting = []

for _ in range(N):
    meeting.append(list(map(int, sys.stdin.readline().split())))

meeting = sorted(meeting, key=lambda x : [x[1], x[0]]) #이부분

cnt = 0
max = 0

for i in meeting:
    if max <= int(i[0]):
        cnt +=1
        max = int(i[1])
print(cnt)

 

▼링크

https://www.acmicpc.net/problem/1931

1931번: 회의실배정