Course Schedule II

There are ·n· different online courses numbered from 1 to n. Each course has some duration(course length) t and closed on dth day. A course should be taken continuously for t days and must be finished before or on the dth day. You will start at the 1st day.

Given n online courses represented by pairs (t,d), your task is to find the maximal number of courses that can be taken.

Example
Given [[100, 200], [200, 1300], [1000, 1250], [2000, 3200]]
return 3

There're totally 4 courses, but you can take 3 courses at most:
First, take the 1st course, it costs 100 days so you will finish it on the 100th day, and ready to take the next course on the 101st day.
Second, take the 3rd course, it costs 1000 days so you will finish it on the 1100th day, and ready to take the next course on the 1101st day.
Third, take the 2nd course, it costs 200 days so you will finish it on the 1300th day.
The 4th course cannot be taken now, since you will finish it on the 3300th day, which exceeds the closed date.

Notice
The integer 1 <= d, t, n <= 10,000.
You can't take two courses simultaneously.

起先想到的就是贪心算法 优先选择到期时间比较小的课程

class Solution:
    """
    @param courses: duration and close day of each course
    @return: the maximal number of courses that can be taken
    """
    
    def scheduleCourse(self, courses):
        # write your code here
        courses.sort(key = lambda x: x[1])
        dur = 0
        for index, ele in enumerate(courses):
            dur += ele[0]
            if dur > ele[1]:
                return index
        return len(courses)

但下面的测试样例报错

[[5,5],[2,6],[4,6]

这里根据根据结束时间排序 只是确定了选择的顺序，但并不能确定是否要选择

import heapq
class Solution:
    """
    @param courses: duration and close day of each course
    @return: the maximal number of courses that can be taken
    """
    
    def scheduleCourse(self, courses):
        # write your code here
        courses.sort(key = lambda x: x[1])
        dur = 0
        l = []
        for index, ele in enumerate(courses):
            heapq.heappush(l, -ele[0])
            dur += ele[0]
            while dur > ele[1]:
                dur -= -heapq.heappop(l)
        return len(l)