Codeforces Solution-C. Minimum Value Rectangle-Solution in C, C++, Java, Python

Algorithm

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 $\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

The first line contains a single integer $T$ ( $T \geq 1$ ) — the number of lists of sticks in the testcase.

Then $2 T$ lines follow — lines $(2 i - 1)$ and $2 i$ of them describe the $i$ -th list. The first line of the pair contains a single integer $n$ ( $4 \leq n \leq 10^{6}$ ) — the number of sticks in the $i$ -th list. The second line of the pair contains $n$ integers $a_{1}, a_{2}, \dots, a_{n}$ ( $1 \leq a_{j} \leq 10^{4}$ ) — 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 $10^{6}$ in each testcase.

Output

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 $\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.

Example
input
Copy
3
4
7 2 2 7
8
2 8 1 4 8 2 1 5
5
5 5 5 5 5
output
Copy
2 7 7 2
2 2 1 1
5 5 5 5

Note

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 \cdot 7 = 14$ , perimeter is $2 (2 + 7) = 18$ . $\frac{18^{2}}{14} \approx 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 $\frac{6^{2}}{2} = 18$ , $\frac{20^{2}}{16} = 25$ and $\frac{18^{2}}{8} = 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)$ .

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int T, n;
map<int, int> mp;
vector<pair<int, int> > all;

double check(int l1, int l2) {
  return pow(l1 * 2 + l2 * 2, 2) / (1.0 * l1 * l2);
}

int main() {
  scanf("%d", &T);
  while(T-- != 0) {
    mp.clear();
    scanf("%d", &n);
    for(int i = 0, tmp; i < n; ++i) {
      scanf("%d", &tmp);
      ++mp[tmp];
    }

    all.clear();
    for(map<int, int>::iterator it = mp.begin(); it != mp.end(); ++it)
      if(it->second > 1)
        all.push_back(make_pair(it->first, it->second));

    int l1 = -1, l2 = -1;
    for(int i = 0; i < all.size(); ++i)
      if(all[i].second > 3)
        l1 = l2 = all[i].first;

    if(l1 == -1 && l2 == -1) {
      double mn = 1e9, tmp;
      for(int i = 1; i < all.size(); ++i) {
        tmp = check(all[i].first, all[i - 1].first);
        if(mn - 1e-15 > tmp) {
          mn = tmp;
          l1 = all[i].first;
          l2 = all[i - 1].first;
        }
      }
    }

    printf("%d %d %d %d\n", l1, l1, l2, l2);
  }

  return 0;
}

Copy The Code & Try With Live Editor

Input

–

cmd

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

Output

–

cmd

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

Demonstration

Codeforces Solution-C. Minimum Value Rectangle-Solution in C, C++, Java, Python,Minimum Value Rectangle,Codeforces Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution

Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+

Try With Live Editor

Category - Codeforces Online Judge Maniruzzaman Akash 1 year ago 343 0