CF1027C.Minimum Value Rectangle
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You have n 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 S be the area of the rectangle and P be the perimeter of the rectangle.
The chosen rectangle should have the value SP2 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.
输入格式
The first line contains a single integer T ( T≥1 ) — the number of lists of sticks in the testcase.
Then 2T lines follow — lines (2i−1) and 2i of them describe the i -th list. The first line of the pair contains a single integer n ( 4≤n≤106 ) — the number of sticks in the i -th list. The second line of the pair contains n integers a1,a2,…,an ( 1≤aj≤104 ) — lengths of the sticks in the i -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 T lists doesn't exceed 106 in each testcase.
输出格式
Print T lines. The i -th line should contain the answer to the i -th list of the input. That is the lengths of the four sticks you choose from the i -th list, so that they form a rectangle and the value SP2 of this rectangle is minimal possible. You can print these four lengths in arbitrary order.
If there are multiple answers, print any of them.
输入输出样例
输入#1
3 4 7 2 2 7 8 2 8 1 4 8 2 1 5 5 5 5 5 5 5
输出#1
2 7 7 2 2 2 1 1 5 5 5 5
说明/提示
There is only one way to choose four sticks in the first list, they form a rectangle with sides 2 and 7 , its area is 2⋅7=14 , perimeter is 2(2+7)=18 . 14182≈23.143 .
The second list contains subsets of four sticks that can form rectangles with sides (1,2) , (2,8) and (1,8) . Their values are 262=18 , 16202=25 and 8182=40.5 , respectively. The minimal one of them is the rectangle (1,2) .
You can choose any four of the 5 given sticks from the third list, they will form a square with side 5 , which is still a rectangle with sides (5,5) .