遭遇了前所未有的苦战
干==
好想跳出去当风筝
def maxEvents(self, events: List[List[int]]) -> int:
pq = []
events.sort()
idx, ans = 0, 0
for i in range(100001):
while idx<len(events) and events[idx][0]<=i:
heappush(pq, events[idx][1])
idx += 1
while pq and pq[0]<i:
heappop(pq)
if pq:
heappop(pq)
ans += 1
return ans