@[我是一个垃圾](/space/show?uid=89396)
@[斗神·君莫笑](/space/show?uid=49644)
@[Asuna_Rivaille](/space/show?uid=56704)
@杨亦诚斗橡皮
@[memset0](/space/show?uid=53495)
@[memset1](/space/show?uid=41918)
by rain_forest @ 2018-11-07 00:51:18
@[一只废柴墨](/space/show?uid=100967)
by rain_forest @ 2018-11-07 00:54:20
@[rain_forest](/space/show?uid=88791)
```
*this
```
是什么东西
别告诉我是什么面向对象的东西啊 我是反对面向对象编程的
by wxy_god @ 2018-11-07 07:01:36
@[我是一个垃圾](/space/show?uid=89396) 那就是左边的
by rain_forest @ 2018-11-07 13:34:56
@[rain_forest](/space/show?uid=88791)
```cpp
#include<bits/stdc++.h>
using namespace std;
struct Node{
int x,y;
}a[100010];
bool cmp(const Node &x,const Node &y){
if(x.x==y.x)return x.y<y.y;
return x.x<y.x;
}
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d%d",&a[i].x,&a[i].y);
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;++i)
printf("%d %d\n",a[i].x,a[i].y);
return 0;
}
```
我的结构体排序
by 斗神_君莫笑 @ 2018-11-08 22:28:47
@[斗神_君莫笑](/space/show?uid=138543) %%%~~dalao您怎么灰了~~
by rain_forest @ 2018-11-09 08:10:02
@[rain_forest](/space/show?uid=88791) 还有第三个点我搞不懂啊
```cpp
15 53
1 3
1 6
1 7
1 9
1 12
1 13
2 3
2 5
2 7
2 8
2 9
2 11
2 14
2 15
3 4
3 5
3 8
3 10
3 12
3 13
3 14
3 15
4 5
4 8
4 10
4 12
4 13
5 6
5 7
5 8
5 9
5 10
5 13
5 14
6 11
6 12
6 13
6 14
7 8
7 13
7 15
8 9
8 10
8 11
9 11
9 12
10 11
10 12
11 15
12 14
12 15
13 14
13 15
0 0 1 0 0 1 1 0 1 0 0 1 1 0 0
0 0 1 0 1 0 1 1 1 0 1 0 0 1 1
1 1 0 1 1 0 0 1 0 1 0 1 1 1 1
0 0 1 0 1 0 0 1 0 1 0 1 1 0 0
0 1 1 1 0 1 1 1 1 1 0 0 1 1 0
1 0 0 0 1 0 0 0 0 0 1 1 1 1 0
1 1 0 0 1 0 0 1 0 0 0 0 1 0 1
0 1 1 1 1 0 1 0 1 1 1 0 0 0 0
1 1 0 0 1 0 0 1 0 0 1 1 0 0 0
0 0 1 1 1 0 0 1 0 0 1 1 0 0 0
0 1 0 0 0 1 0 1 1 1 0 0 0 0 1
1 0 1 1 0 1 0 0 1 1 0 0 0 1 1
1 0 1 1 1 1 1 0 0 0 0 0 0 1 1
0 1 1 0 1 1 0 0 0 0 0 1 1 0 0
0 1 1 0 0 0 1 0 0 0 1 1 1 0 0
NO
```
by rain_forest @ 2018-11-09 08:20:27