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