题目链接：https://www.

我的代码：
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<vector>
#include<set>
#include<queue>
using namespace std;

int n;

struct node{
    int l;
    int w;
    friend bool operator < (node a,node b){
        if(a.l!=b.l) return a.l<b.l;
        return a.w<b.w;
    }
}t1,t2;

priority_queue<node> q1,q2;

int main(void){
    int i,k=0,w0;
    while(!q1.empty()) q1.pop();
    while(!q2.empty()) q2.pop();
    scanf("%d",&n);
    for(i=1;i<=n;i++){
      scanf("%d %d",&t1.l,&t1.w);
      q1.push(t1);
    }
    while(!q1.empty() || !q2.empty()){
        k++;
        if(k&1){
            t1=q1.top();
            q1.pop();
            w0=t1.w;
            while(!q1.empty()){
                t2=q1.top();
                q1.pop();
                if(t2.w>w0) q2.push(t2);
            }
        }
        else{
            t1=q2.top();
            q2.pop();
            w0=t1.w;
            while(!q2.empty()){
                t2=q2.top();
                q2.pop();
                if(t2.w>w0) q1.push(t2);
            }
        }
    }
    printf("%d\n",k);
    return 0;
}

错了好几个测试点，不知道错在哪里，求大佬帮忙看一下。

看不懂你的算法逻辑

#include <cstdio>
#include <algorithm>

int main( void )
{
    struct Wood
    {
        unsigned L, W;
    };
    Wood ws[5000];
    size_t ws_len;

    // 输入
    scanf( "%zu", &ws_len );
    for( size_t i=0; i!=ws_len; ++i )
        scanf( "%u%u", &ws[i].L, &ws[i].W );

    // 排序
    std::sort( ws, ws+ws_len, [](const auto& a, const auto& b){return a.L!=b.L ? a.L>b.L : a.W>b.W;} );

    // 至少分成多少个非递减序列
    unsigned groups[5000];
    size_t groups_len = 0;
    for( unsigned i=0; i!=ws_len; ++i )
    {
        unsigned* p = std::lower_bound( groups, groups+groups_len, ws[i].W );
        if( p == groups+groups_len )
            groups[groups_len++] = ws[i].W;
        else
            *p = ws[i].W;
    }
    printf( "%zu\n", groups_len );
}