HEU 5039 Move Woods

 1/**//**************************************
 2Problem: HEU 5039 Move Woods
 3Time: 0.0050 s
 4Memory: 240 k 
 5Accepted Time: 2009-03-31 11:33:12
 6Tips: 两个关键字排序 
 7**************************************/
 8#include <stdio.h>
 9int main()
{
    int tt;
    scanf("%d",&tt);
    while(tt--)
    {
        int n,i,j,k,a[300],b[300],c[300],temp,sum=0;
        scanf("%d",&n);
        if(n==0){printf("0\n");continue;}
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&a[i],&b[i]);
            c[i]=0;
        }
        for(i=0;i<n-1;i++)
        {
            for(j=n-1;j>i;j--)
            {
                if(a[j]<a[j-1])
                {
                    temp=a[j];
                    a[j]=a[j-1];
                    a[j-1]=temp;
                    temp=b[j];
                    b[j]=b[j-1];
                    b[j-1]=temp;
                }
                else if(a[j]==a[j-1]&&b[j]<b[j-1])
                {
                    temp=b[j];
                    b[j]=b[j-1];
                    b[j-1]=temp;
                }
            }
        }
        for(i=0;i<n;i++)
        {
            if(c[i]==0)
            {
                k=b[i];
                c[i]=1;
                for(j=i+1;j<n;j++)
                {
                    if(c[j]==0&&k<=b[j])
                    {
                        k=b[j];
                        c[j]=1;
                    }
                }
                sum++;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}