AcWing 4167. 活动安排_Python3
原题链接
简单
作者:
楪祈inori
,
2021-12-30 18:32:26
,
所有人可见
,
阅读 431
算法
排序+贪心, 每次挑距离结束时间最近的开始时间的活动
Python 代码
def solve(courses) -> int:
courses = sorted(courses, key=lambda x: x[1])
n = len(courses)
ans = []
cur = -1
for i in range(n):
if courses[i][0] > courses[i][1]:
continue
if cur <= courses[i][0]:
ans.append(courses[i])
cur = courses[i][1]
return len(ans)
if __name__ == '__main__':
n = int(input())
cur = [[int(i) for i in j] for j in [input().split() for _ in range(n)]]
print(solve(cur))