codeforces-1027 C Minimum Value Rectangle

#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <vector>
#include <queue>
#define DEF 0x3f3f3f3f
using namespace std;

int main()
{
    int T;
    scanf("%d",&T);
    while(T --)
    {
        int n;
        int hash[10001] {0};
        vector<int> deal;
        double diff = 10001;
        int edge1 = 0,edge2 = 0;
        int flag = 0;
        
        scanf("%d
",&n);
        while(n --)
        {
            int tmp;
            scanf("%d",&tmp);
            hash[tmp] ++;
            if(hash[tmp]==2)
                deal.emplace_back(tmp);
            if(hash[tmp]==4)
            {
                flag = 1;
                edge1 = edge2 = tmp;
            }
        }
        
        if(flag)
        {
            printf("%d %d %d %d
",edge1,edge1,edge2,edge2);
            continue;
        }
        sort(deal.begin(),deal.end());
        double minidiff = DEF;
        for(int i = 0; i < deal.size()-1; i ++)
        {
            double tmp_diff = (double)deal[i+1]/(double)deal[i] + (double)deal[i]/(double)deal[i+1];
        //    cout << deal[i+1] << " " << deal[i] << " " << tmp_diff << endl;
            if(tmp_diff<diff)
            {
                edge1 = deal[i];
                edge2 = deal[i+1];
                diff = tmp_diff;
            }
        }
        printf("%d %d %d %d
",edge1,edge1,edge2,edge2);
    }
    return 0;
}