HDU 1051 Wooden Sticks 贪心

#include<cstdio>
#include<iostream>
#include<cstring>
#include<set>
#include<algorithm>
#define MAXN  5010
using namespace std;

struct node
{
    int len,wei,sum;
    bool operator <(const  node &th) const
    {
        if(len==th.len)
            return th.wei>wei;
        else return th.len>len;
    }
};
node stick[MAXN];
int main()
{
    // freopen("in.txt","r",stdin);
    int cas,n;
    cin>>cas;
    while(cas--)
    {
        cin>>n;
        for(int i=0; i<n; i++)
        {
            int a,b;
            cin>>a>>b;
            stick[i].len=a,stick[i].wei=b,stick[i].sum=a+b;
        }
        sort(stick,stick+n);
        int time=0;
        int vis[MAXN];
        memset(vis,0,sizeof(vis));
        while(1)
        {
            int flag=0;
            for(int i=0; i<n; i++)
            {
                if(!vis[i])
                {
                    time++;
                    flag=1;
                    vis[i]=1;
                    int temp=stick[i].wei;
                    for(int j=i+1; j<n; j++)
                        if(stick[j].wei>=temp&&!vis[j])
                        {
                            vis[j]=1;
                            temp=stick[j].wei;
                        }
                    break;
                }
            }
            if(!flag)  break;
        }
        cout<<time<<endl;
    }
    return 0;
}