#include <stdio.h>
#include <algorithm>
using namespace std;
struct data{
int x,y,i;
bool operator<(const data&r)const{
return x<r.x;
}
}a[910];
int main(){
int i,n;
scanf("%d",&n);
n*=3;
for(i=1;i<=n;++i)scanf("%d%d",&a[i].x,&a[i].y),a[i].i=i;
sort(a+1,a+n+1);
for(i=1;i<=n;i+=3)printf("%d %d %d\n",a[i].i,a[i+1].i,a[i+2].i);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1092 KB |
Output is correct |
2 |
Correct |
0 ms |
1092 KB |
Output is correct |
3 |
Correct |
0 ms |
1092 KB |
Output is correct |
4 |
Correct |
0 ms |
1092 KB |
Output is correct |
5 |
Correct |
0 ms |
1092 KB |
Output is correct |
6 |
Correct |
0 ms |
1092 KB |
Output is correct |
7 |
Correct |
0 ms |
1092 KB |
Output is correct |
8 |
Correct |
0 ms |
1092 KB |
Output is correct |
9 |
Correct |
0 ms |
1092 KB |
Output is correct |
10 |
Correct |
0 ms |
1092 KB |
Output is correct |
11 |
Correct |
0 ms |
1092 KB |
Output is correct |
12 |
Correct |
0 ms |
1092 KB |
Output is correct |
13 |
Correct |
0 ms |
1092 KB |
Output is correct |
14 |
Correct |
0 ms |
1092 KB |
Output is correct |
15 |
Correct |
0 ms |
1092 KB |
Output is correct |
16 |
Correct |
0 ms |
1092 KB |
Output is correct |
17 |
Correct |
0 ms |
1092 KB |
Output is correct |
18 |
Correct |
0 ms |
1092 KB |
Output is correct |
19 |
Correct |
0 ms |
1092 KB |
Output is correct |
20 |
Correct |
0 ms |
1092 KB |
Output is correct |