一个挺正常的区间覆盖问题,可是我做了好一会儿……其实就是先排序,再进行处理,每次进行贪心的判断即可。
代码:
n = int(input())
nums = [list(map(int, input().split())) for _ in range(n)]
nums.sort()
left, right = nums.pop(0)
for tmp in nums:
if tmp[0] <= right:
right = max(right, tmp[1])
else:
print(left, right)
left, right = tmp
print(left, right)