#include <stdio.h>
#include <algorithm>
using namespace std;
struct A{
int x;
int y;
int k;
}point[999];
bool operator<(A X, A Y) {
if(X.y!=Y.y) return X.y<Y.y;
return X.x<Y.x;
}
int main() {
int n;
scanf("%d", &n);
int i, j;
for(i=1; i<=3*n; i++) {
scanf("%d %d", &point[i].x, &point[i].y);
point[i].k=i;
}
sort(point+1, point+3*n+1);
for(i=0; i<n; i++) {
for(j=1; j<=3; j++) {
printf("%d ", point[i*3+j].k);
}
printf("\n");
}
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 |
