hdu1051Wooden Sticks

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

简简单单的贪心，竟然错了好几次。。。

思路：先排序，按照长度升序，或者重量升序，在查找。。

代码：

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

typedef struct
{
    int length;
    int weight;
} stick;

stick a[5005];
int v[5005];
bool cmp(stick x,stick y)

{
    if(x.length != y.length)
        return x.length < y.length;
    else if(x.weight != y.weight)
        return x.weight < y.weight;
}
int main()

{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(v,0,sizeof v);
        int n;
        scanf("%d",&n);
        for(int i = 0; i < n; ++i)
        {
            scanf("%d%d",&a[i].length,&a[i].weight);
        }
        sort(a,a + n,cmp);
        int ans = 0;
        for(int i = 0;i < n;++i)
        {
            int tl = a[i].length;
            int tw = a[i].weight;
            if(!v[i])
            {
                v[i] = 1;
                for(int j = i + 1;j < n;++j)
                {
                    if(a[j].length >= tl && a[j].weight >= tw && !v[j])
                    {
                        //printf("%d ",j);
                        v[j] = 1;
                        tl = a[j].length;
                        tw = a[j].weight;
                    }
                }
               // printf("\n");
                ans++;
            }

        }
        printf("%d\n",ans);

    }
    return 0;
}