【编程题解】Curry’s problem

Description

Mr.Durant gave Curry a sequence named A,and the length is n. In this sequence, all the Numbers are different. For each number Ai in A, can you help curry to find:

And j(call it Pi) makes the above formula the have minimum value . If the minimum point is not unique, select the one that makes Aj smaller.

 

Input

Enter the integer n on the first line, representing the sequence length.

On the second line, enter n integers A1... An, represents the specific values of the sequence, separated by Spaces.

Data range:n≤10^5,|Ai|≤10^9;

 

Output

Output n-1 lines, each with two integers, separated by Spaces.

Respectively represent the values of and Pi when i is from 2 to n.

Sample Input 1 

4
1 5 2 7

Sample Output 1

4 1
1 1
2 2

 

Personal Answer  (using language：JAVA)  Not necessarily right

public class Main {
    public static void main(String[] args) {
        System.out.println("Unsolved");
    }
}

Welcome to communicate!