HDOJ--5240--Exam

题目描述：
As this term is going to end, DRD needs to prepare for his final exams.
DRD has n exams. They are all hard, but their difficulties are different. DRD will spend at least ri hours on the i-th course before its exam starts, or he will fail it. The i-th course’s exam will take place ei hours later from now, and it will last for li hours. When DRD takes an exam, he must devote himself to this exam and cannot §review any courses. Note that DRD can review for discontinuous time.
So he wonder whether he can pass all of his courses.
No two exams will collide.
输入描述:
First line: an positive integer T≤20 indicating the number of test cases.
There are T cases following. In each case, the first line contains an positive integer n≤105, and n lines follow. In each of these lines, there are 3 integers ri,ei,li, where 0≤ri,ei,li≤109.
输出描述:
For each test case: output ‘‘Case #x: ans’’ (without quotes), where x is the number of test cases, and ans is ‘‘YES’’ (without quotes) if DRD can pass all the courses, and otherwise ‘‘NO’’ (without quotes).
输入：
2
3
3 2 2
5 100 2
7 1000 2
3
3 10 2
5 100 2
7 1000 2
输出：
Case #1: NO
Case #2: YES
题意：
这个学期共有n门课程需要考，并且每门课程都不容易，但是每门课的难度系数并不一样。如果他想过第i门课程，那么他需要在考试开始前花至少ri小时来复习这门课，否则他就会挂掉。第i门课将在距离现在ei小时后开始考试，考试时长为li小时。每门课考试的时候他都会全力以赴，专心考试到考试结束才考虑别的课程的复习。
现在想知道他能否通过所有的考试。题目保证任何两门课考试时间不会发生冲突。
题解：
简单贪心，按照开始时间排个序
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 100000 + 5;
struct point{
    int t,st,h;
};

point a[maxn];

int cmp(point x,point y){
    return x.st < y.st;
}

int main(){
    int t,n;
    int cas = 1;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i = 0; i < n; i ++){
            scanf("%d%d%d",&a[i].t,&a[i].st,&a[i].h);
        }
        sort(a, a + n,cmp);
        int sum = 0;
        bool flag = true;
        for(int i = 0; i < n; i ++){
            sum += a[i].t;
            if(sum > a[i].st){
                flag = false;
                break;
            }
            sum += a[i].h;
        }
        if(flag){
            printf("Case #%d: YES\n",cas ++);
        }
        else{
            printf("Case #%d: NO\n",cas ++);
        }
    }
    return 0;
}