【解题报告】【HDOJ2037】【贪心算法】今年暑假不AC

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2037

#include<stdio.h>
struct node{
    int x,y;
};
int main()
{
    struct node a[101];
    int i,j,n,sum,q,y,w,t;
    //freopen("1.txt","r",stdin);
    while(scanf("%d",&n)!=EOF&&n)
    {
        for(i=0;i<n;i++) scanf("%d%d",&a[i].x,&a[i].y);
        for(i=0;i<n;i++)
        {
            for(j=i;j<n;j++)
            {
                if(a[i].y>a[j].y)
                {
                    t=a[i].x;
                    a[i].x=a[j].x;
                    a[j].x=t;
                    t=a[i].y;
                    a[i].y=a[j].y;
                    a[j].y=t;
                }
            }
        }
        
        q=0;w=a[0].y;
        sum=1;
        for(i=1;i<n;i++)
        {
            if(a[i].x>=w)
            {
                w=a[i].y;
                sum++;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}