![[백준 알고리즘] 1931번 회의실배정(Python)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbnqPU9%2FbtqCzBxahlX%2Fb9i77F9Bx2lNlWr0sMBj0k%2Fimg.png)
언어, 알고리즘 공부/백준2020. 3. 10. 16:39[백준 알고리즘] 1931번 회의실배정(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