알고리즘/1. 그리디
#1931 회의실 배정
by hyeryun
2023. 1. 7.
# 시간초과
n = int(input())
data = [list(map(int, input().split())) for _ in range(n)]
data.sort()
result = [0 for _ in range(n)]
for i in range(n):
last = data[i][1]
for j in range(i, n):
if data[j][0] >= last:
result[i] += 1
last = data[j][1]
print(max(result) + 1)
# 정답
n = int(input())
data = [list(map(int, input().split())) for _ in range(n)]
data.sort(key=lambda x: (x[1], x[0]))
result = 0
last = 0
for d in data:
if d[0] >= last:
last = d[1]
result +=1
print(result)
# sys.stdin.readline() vs input() 속도차이