HD-ACM算法专攻系列（21）——Wooden Sticks

#include"iostream"
#include"algorithm"
using namespace std;

struct Stick
{
    int l;
    int w;
    bool processed;
};

bool cmp(Stick a, Stick b)
{
    
    if(a.l < b.l)
    {
        return true;
    }
    else if(a.l == b.l)
    {
        return a.w < b.w;
    }
    else
    {
        return false;
    }
}

int main()
{
    int t, n, total, val;
    Stick s[5000];
    scanf("%d", &t);
    for(int i = 0; i < t; i++)
    {
        scanf("%d", &n);
        total = 0;
        for(int j = 0; j < n; j++)
        {
            scanf("%d %d", &s[j].l, &s[j].w);
            s[j].processed = false;
        }
        sort(s, s+n, cmp);
        for(int j = 0; j < n; j++)
        {
            if(!s[j].processed)
            {
                total++;
                val = s[j].w;
                s[j].processed = true;
                for(int k = j + 1; k < n; k++)
                {
                    if(!s[k].processed && s[k].w >= val)
                    {
                        val = s[k].w;
                        s[k].processed = true;
                    }
                }
            }
        }
        printf("%d\n", total);
    }
    return 0;
}