- #include<cstdio>
- #include<algorithm>
- #include<iostream>
- using namespace std;
- struct find
- {
- int a,b;
- }sum[101];
- bool com(struct find &x,struct find &y)
- {
- return x.a<y.a;
- }
- int main()
- {
- int n,tot=1;
- scanf("%d",&n);
- for(int i=1;i<=n;i++)
- {
- scanf("%d%d",&sum[i].a,&sum[i].b);
- if (sum[i].a>sum[i].b)
- swap(sum[i].a, sum[i].b);
- }
- sort(sum+1,sum+n+1,com);
- int end = sum[1].b;
- for (int i = 2; i <= n; i++)
- {
- if (sum[i].a>= end)
- {
- tot++;
- end = sum[i].b;
- }
- }
- printf("%d",tot);
- return 0;
- }
来源: http://www.bubuko.com/infodetail-2889544.html