#include <stdio.h>
#include <algorithm>
using namespace std;
int z[900];
int main(void)
{
int x, y, N, i;
scanf("%d", &N);
for(i = 0; i < 3*N; i++)
{
scanf("%d %d", &x, &y);
if(x + y >= 0)
z[i] = (x + y)*1000 + i + 1;
else
z[i] = (x + y)*1000 - i - 1;
}
sort(z, z + 3*N);
for(i = 0; i < 3*N; i++)
{
if(z[i] < 0)
z[i] = -z[i];
printf("%d", z[i]%1000);
if((i + 1)%3)
printf(" ");
else
printf("\n");
}
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 |