HDU ACM 1050 貪心

注意：輸入順序可以使凌亂的。

#include<iostream>
using namespace std;
inline void swap_(int &a,int &b)
{
    int tmp_ = a;
    a = b;
    b = tmp_;
}
int main()
{
    typedef struct range{
        int beg;
        int end;
        bool m;
    }range;
    range r[200];
    range tmp;
    int t,n,i,r1,r2,endnum,res,moved;
    scanf("%d",&t);
    while(t--,t>=0)
    {
        endnum = res = moved = 0;
        scanf("%d",&n);
        for(i = 0 ; i < n ; i ++)
        {
            scanf("%d%d",&r1,&r2);
            if(r1%2 == 0)r1--;
            if(r2%2 == 0)r2--;
            if(r1 > r2)swap_(r1,r2);
            r[i].beg = r1;
            r[i].end  = r2;
            r[i].m = false;
        }
        for(i = 0 ; i < n-1 ; i++)
            for(int j = 1 ; j < n-i ; j++)
            {
                if(r[j].beg < r[j-1].beg)
                {
                    tmp = r[j];
                    r[j] =r[j-1];
                    r[j-1] = tmp;
                }
            }
        while(endnum = 0,moved < n)
        {
            for(i = 0 ; i < n ; i++)
            {
                if(r[i].beg>endnum && r[i].m == false)
                {
                    endnum = r[i].end;
                    r[i].m = true;
                    moved ++;
                }
            }
            res++;
        }
        res = res*10;
        printf("%d\n",res);
    }
    return 0;
}