630. Course Schedule III

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:

Input: [[100, 200], [200, 1300], [1000, 1250], [2000, 3200]]
Output: 3
Explanation: 
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.

Note:

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

方法1: greedy

思路：

1. 按照课程的deadline排序：也就是说，优先考虑那些比较紧迫的课。
2. 建立一个priority_queue, 按照duration，始终offer用时最长的课程。
3. 开始遍历sorted course，首先将这门课推队，其次如果预计的本门课完成时间将超出它的deadline，为了能上这门课，我们把优先队列队首元素拿掉，更新curtime。注意关键在于，不上这门耗时最久的课，此时我们能保证新的这门课一定能上完，这就是。为什么呢？首先swap掉最长的课，总的耗时一定会减少，也就是说上一个deadline不会被violate，只可能更提前完成，那么本门课的deadline一定晚于上一个deadline，那么也一定能完成。这就是优先队列和按照deadline排序决定的优势。

class Solution {
public:
    int scheduleCourse(vector<vector<int>>& courses) {
        sort(courses.begin(), courses.end(), [](const vector<int> & a, const vector<int> & b){
            return a[1] < b[1];
        });
        priority_queue<int> pq;
        int curtime = 0;
        for(auto course: courses) {
            curtime += course[0];
            pq.push(course[0]);
            if (curtime > course[1]) {
                int longest = pq.top();
                pq.pop();
                curtime -= longest;
            }
        }
        return pq.size();        
    }
};