def fn(x):
return x[0]
mettings = []
for _ in range(int(input())):
start, end = map(int, input())
mettings.append((end, start))
mettings = sorted(mettings, key=fn)
t = 0
mettings_cnt = 0
for end, start in mettings:
if t <= start :
mettings_cnt += 1
t = end
'Algorithm > 기본 알고리즘' 카테고리의 다른 글
| leetcode 28. Find the index of the First Occurence in a String (0) | 2023.01.21 |
|---|---|
| leetcode 24. Swap Nods in Pairs (0) | 2023.01.21 |
| boj-5397. 키 로거 (0) | 2023.01.20 |
| boj-7785. 회사에있는사람 (0) | 2023.01.20 |
| boj-2164. 카드 2 (0) | 2023.01.19 |