CF BUDDY
← Problems·

1027C · Minimum Value Rectangle

1600 · greedy

Problem: You have nn sticks of the given lengths.

Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be chosen multiple times. It is guaranteed that it is always possible to choose such sticks.

Let SS be the area of the rectangle and PP be the perimeter of the rectangle.

The chosen rectangle should have the value P2S\frac{P^2}{S} minimal possible. The value is taken without any rounding.

If there are multiple answers, print any of them.

Each testcase contains several lists of sticks, for each of them you are required to solve the problem separately.

Input Format: The first line contains a single integer TT (T1T \ge 1) — the number of lists of sticks in the testcase.

Then 2T2T lines follow — lines (2i1)(2i - 1) and 2i2i of them describe the ii-th list. The first line of the pair contains a single integer nn (4n1064 \le n \le 10^6) — the number of sticks in the ii-th list. The second line of the pair contains nn integers a1,a2,,ana_1, a_2, \dots, a_n (1aj1041 \le a_j \le 10^4) — lengths of the sticks in the ii-th list.

It is guaranteed that for each list there exists a way to choose four sticks so that they form a rectangle.

The total number of sticks in all TT lists doesn't exceed 10610^6 in each testcase.

Output Format: Print TT lines. The ii-th line should contain the answer to the ii-th list of the input. That is the lengths of the four sticks you choose from the ii-th list, so that they form a rectangle and the value P2S\frac{P^2}{S} of this rectangle is minimal possible. You can print these four lengths in arbitrary order.

If there are multiple answers, print any of them.

Note: There is only one way to choose four sticks in the first list, they form a rectangle with sides 22 and 77, its area is 27=142 \cdot 7 = 14, perimeter is 2(2+7)=182(2 + 7) = 18. 1821423.143\frac{18^2}{14} \approx 23.143.

The second list contains subsets of four sticks that can form rectangles with sides (1,2)(1, 2), (2,8)(2, 8) and (1,8)(1, 8). Their values are 622=18\frac{6^2}{2} = 18, 20216=25\frac{20^2}{16} = 25 and 1828=40.5\frac{18^2}{8} = 40.5, respectively. The minimal one of them is the rectangle (1,2)(1, 2).

You can choose any four of the 55 given sticks from the third list, they will form a square with side 55, which is still a rectangle with sides (5,5)(5, 5).

Sample Cases

Case 1

Input

3
4
7 2 2 7
8
2 8 1 4 8 2 1 5
5
5 5 5 5 5

Output

2 7 7 2
2 2 1 1
5 5 5 5

Similar problems

00:00:00
Loading editor…
Welcome! I'm your coding tutor for this problem. Use the chips below to reveal stored hints or get AI feedback on your code. I'll guide you step by step — never giving away the solution.

Sign in to unlock AI tutor feedback