언어, 알고리즘 공부/백준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