HDU-5240 Exam The 2015 ACM-ICPC China Shanghai Metropolitan Programming Contest

这是一道比较水的贪心题目，也是整场比赛的签到题目，直接水之~

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
using namespace std;
struct node
{
    int r,e,l;
}a[111111];
int n;
bool cmp(node a,node b){
    if(a.e == b.e){
        return a.r<b.r;
    }
    return a.e<b.e;
}
int main()
{
    int T;
    int xxx = 1;
    int i,j;
    cin >> T;
    while(T--)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++){
            scanf("%d%d%d",&a[i].r,&a[i].e,&a[i].l);
        }
        sort(a,a+n,cmp);
        int xiaohao = 0;
        bool flag = 1;
        for(i=0;i<n;i++){
            a[i].e -= xiaohao;
            if(a[i].e<a[i].r){
                flag = false;
                break;
            }
            xiaohao += (a[i].l+a[i].r);
        }
        if(flag){
            printf("Case #%d: YES\n",xxx++);
        }
        else{
            printf("Case #%d: NO\n",xxx++);
        }
    }
    return 0;
}