#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair <int, int> ii;
typedef pair <ii, int> iii;
vector < iii > v;
int main(){
int n;
scanf("%d", &n);
for(int i=0; i< 3*n; i++){
int x, y;
scanf("%d %d", &x, &y);
v.push_back(iii(ii(x, y), i+1));
}
sort(v.begin(), v.end());
for(int i=0; i<n; i++){
for(int j=0; j<3; j++)
printf("%d ", v[3*i+j].second);
puts("");
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1208 KB |
Output is correct |
2 |
Correct |
0 ms |
1208 KB |
Output is correct |
3 |
Correct |
0 ms |
1208 KB |
Output is correct |
4 |
Correct |
0 ms |
1208 KB |
Output is correct |
5 |
Correct |
0 ms |
1208 KB |
Output is correct |
6 |
Correct |
0 ms |
1208 KB |
Output is correct |
7 |
Correct |
0 ms |
1208 KB |
Output is correct |
8 |
Correct |
0 ms |
1208 KB |
Output is correct |
9 |
Correct |
0 ms |
1208 KB |
Output is correct |
10 |
Correct |
0 ms |
1208 KB |
Output is correct |
11 |
Correct |
0 ms |
1208 KB |
Output is correct |
12 |
Correct |
0 ms |
1208 KB |
Output is correct |
13 |
Correct |
0 ms |
1208 KB |
Output is correct |
14 |
Correct |
0 ms |
1208 KB |
Output is correct |
15 |
Correct |
0 ms |
1208 KB |
Output is correct |
16 |
Correct |
0 ms |
1208 KB |
Output is correct |
17 |
Correct |
0 ms |
1208 KB |
Output is correct |
18 |
Correct |
0 ms |
1208 KB |
Output is correct |
19 |
Correct |
0 ms |
1208 KB |
Output is correct |
20 |
Correct |
0 ms |
1208 KB |
Output is correct |