#include<stdio.h>
#include<algorithm>
using namespace std;
struct cr {
int nu, x, y;
bool operator< (const cr& c) const {
if(x!=c.x)return x<c.x;
return y<c.y;
}
}ba[1111];
int main(){
int n, i;
scanf("%d", &n);
for(i=0; i<3*n; i++){
scanf("%d%d", &ba[i].x, &ba[i].y);
ba[i].nu=i+1;
}
sort(ba, ba+3*n);
for(i=0; i<n; i++)printf("%d %d %d\n", ba[3*i].nu, ba[3*i+1].nu, ba[3*i+2].nu);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1100 KB |
Output is correct |
2 |
Correct |
0 ms |
1100 KB |
Output is correct |
3 |
Correct |
0 ms |
1100 KB |
Output is correct |
4 |
Correct |
0 ms |
1100 KB |
Output is correct |
5 |
Correct |
0 ms |
1100 KB |
Output is correct |
6 |
Correct |
0 ms |
1100 KB |
Output is correct |
7 |
Correct |
0 ms |
1100 KB |
Output is correct |
8 |
Correct |
0 ms |
1100 KB |
Output is correct |
9 |
Correct |
0 ms |
1100 KB |
Output is correct |
10 |
Correct |
0 ms |
1100 KB |
Output is correct |
11 |
Correct |
0 ms |
1100 KB |
Output is correct |
12 |
Correct |
0 ms |
1100 KB |
Output is correct |
13 |
Correct |
0 ms |
1100 KB |
Output is correct |
14 |
Correct |
0 ms |
1100 KB |
Output is correct |
15 |
Correct |
0 ms |
1100 KB |
Output is correct |
16 |
Correct |
0 ms |
1100 KB |
Output is correct |
17 |
Correct |
0 ms |
1100 KB |
Output is correct |
18 |
Correct |
0 ms |
1100 KB |
Output is correct |
19 |
Correct |
0 ms |
1100 KB |
Output is correct |
20 |
Correct |
0 ms |
1100 KB |
Output is correct |