boj 1931

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

meeting = int(input())
meeting_list = []
count = 1 #회의는 반드시 1개 이상 
for i in range(meeting):
    start, end = map(int, input().split())
    meeting_list.append([start , end]) 

meeting_list.sort(key=lambda x:(x[1], x[0])) 
temp = meeting_list[0][1]
for i in range(1,meeting):
    if meeting_list[i][0] >= temp:
        count += 1
        temp = meeting_list[i][1]
print(count)

notion

• 그리디 알고리즘