你用冒泡排序肯定T
by Waaifu_D @ 2021-09-19 10:05:32
@[huangyuhan123456](/user/461452) 你需要sort大法！
by ajahjahah @ 2021-09-19 10:12:46
@[Waaifu](https://www.luogu.com.cn/user/358779)
@[lao_ba](https://www.luogu.com.cn/user/357378)
就是不知道sort怎么连同附属元素一起交换
by SunLegend @ 2021-09-19 10:16:16
快排又不会写……
by SunLegend @ 2021-09-19 10:16:58
@[huangyuhan123456](/user/461452) 用结构体
by Srikasso @ 2021-09-26 13:00:17
@[huangyuhan123456](/user/461452) 结构体排序
by Srikasso @ 2021-09-26 13:00:43
@[huangyuhan123456](/user/461452)
结构体排序啊！！
by 清小秋ovo @ 2021-11-29 20:08:28
代码如下↓
```c
#include <iostream>
#include <algorithm>
using namespace std;
struct Test{
int a, b;
}test[1000005];
bool cmp(Test x, Test y){
return x.b < y.b;
}
int main(){
int n , ans=1, pik=1;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> test[i].a >> test[i].b;
}
sort(test + 1, test + n + 1, cmp);
for (int i = 2; i <= n; i++)
{
if (test[i].a >= test[pik].b)
{
ans++;
pik = i;
}
}
printf("%d", ans);
return 0;
}
```
结尾保留2位小数也可以用iomanip
by IRIDESCENTqwq @ 2021-12-12 09:45:46