~~QNDMX~~
by Stick_With_Mars @ 2019-09-21 17:08:01
@[程子凌](/space/show?uid=237981) 排序后要DP，贪心是错的
by Soledad_S @ 2019-09-21 17:40:23
## 仅仅是ma < x[i].b 是不够的```
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
struct node
{
int l,w;
}num[5005];
int nu[5005][2];
int n;
bool cmp(node a,node b)
{
if(a.l == b.l)
return a.w > b.w;
else
return a.l > b.l;
}
int main(){
scanf("%d",&n);
for(int i = 0;i < n;i++)
scanf("%d%d",&num[i].l,&num[i].w);
sort(num,num+n,cmp);
nu[0][0] = num[0].l,nu[0][1] = num[0].w;
int in = 0;
bool f;
for(int i = 1;i < n;i++)
{
f = 0;
for(int j = 0;j <= in;j++)
{
if(nu[j][0] >= num[i].l && nu[j][1] >= num[i].w)
{
f = 1,nu[j][0] = num[i].l ,nu[j][1] = num[i].w;
break;
}
}
if(!f)
nu[++in][0] = num[i].l,nu[in][1] = num[i].w;
}
printf("%d",in+1);
return 0;
}
```
by dsy456123 @ 2019-09-29 18:29:31
谢啦!!☆⌒(*＾-゜)v
by 红云爱吃糖 @ 2019-10-02 22:49:06
☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆☆
by zhanghanbin @ 2020-01-03 17:29:32