영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given an array of n integers. You will perform n-1 operations on the array.
In one operation, you will choose two numbers a and b from the array, delete both of them from the array and add |a - b| into the array.
Your task is to find a sequence of operations such that the last number remaining in the array is 0.
Input
The first line has an integer n: the length of the array.
The next line has n integers x_1, x_2,…, x_n: the contents of the array.
Output
Print n-1 lines each containing two integers a and b: the numbers chosen in the operations. You can print any valid solution.
If no solution exists, print only -1.
Constraints
- 2 ≤ n ≤ 1000
- 1 ≤ x_i ≤ 1000
Example
Explanation: The array changes as follows:
- [2, 7, 4, 12, 1] → remove 2 and 12, add 10
- [7, 4, 1, 10] → remove 7 and 10, add 3
- [4, 1, 3] → remove 4 and 1, add 3
- [3, 3] → remove 3 and 3, add 0
- [0]: the final array
예제
예제 1
5 2 7 4 12 1
2 12 7 10 4 1 3 3