记录编号	569050	评测结果	AAAAAAAAAA
题目名称	木棍加工	最终得分	100
用户昵称	lihaoze	是否通过	通过
代码语言	C++	运行时间	0.000 s
提交时间	2022-02-14 15:11:04	内存使用	0.00 MiB

#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#define OPEN(_x) freopen(#_x".in", "r", stdin); freopen(#_x".out", "w", stdout)
#define ABS(_x) ((_x)<0?(-(_x)):(_x))
#define MAX(_a, _b) ((_a)<(_b)?(_b):(_a))
#define MIN(_a, _b) ((_a)>(_b)?(_b):(_a))
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

namespace IO{
    template<typename T>
    inline T read() {
        T ret=0, sig=1; char ch=0;
        while(ch<'0'||ch>'9') { if(ch=='-') sig=-1; ch=getchar(); }
        while(ch>='0'&&ch<='9') { ret=(ret<<1)+(ret<<3)+ch-'0'; ch=getchar(); }
        return ret*sig;
    }
    template<typename T>
    inline void read(T &x) {
        T ret=0, sig=1; char ch=0;
        while(ch<'0'||ch>'9') { if(ch=='-') sig=-1; ch=getchar(); }
        while(ch>='0'&&ch<='9') { ret=(ret<<1)+(ret<<3)+ch-'0'; ch=getchar(); }
        x = ret*sig;
    }
    template<typename T>
    inline void write(T x) {
        if(x<0) putchar('-'), x=-x;
        T stk[100], tt=0;
        do stk[tt++]=x%10, x/=10; while(x);
        while(tt) putchar(stk[--tt]+'0');
    }
};


struct Node {
    int l, w;
    inline bool operator > (const Node &rst) { return (l >= rst.l && w >= rst.w); }
    inline bool operator == (const Node &rst) { return l==rst.l && w==rst.w; }
};

inline bool cmp(Node a, Node b) {
    if(a.l > b.l) return true;
    if(a.l == b.l) return a.w >= b.w;
    return false;
}

const int N = 5010;
Node a[N], p[N];
int n;


int main() {
    #ifdef DEBUG
    OPEN(test);
    #endif
    OPEN(sticks);
    IO::read(n);
    for(register int i = 1; i<=n; ++i) a[i] = {IO::read<int>(), IO::read<int>()};
    int res = 0;
    sort(a+1, a+1+n, cmp);
    for(register int i = 1; i<=n; ++i) {
        if(p[res] == a[i]) continue;
        if(a[i] > p[res] || (!(a[i]>p[res]) && !(p[res]>a[i]))) p[++res] = a[i]; 
        else {
            int l = 0, r = res;
            while(l < r) {
                int mid = l+r>>1;
                if(p[mid] > a[i]) r = mid;
                else l = mid+1;
            }
            p[r] = a[i];
        }
    }
    IO::write(res);
    return 0;
}