F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Valentine's Day

Time Limit: 2000/2000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 1666    Accepted Submission(s): 585
Special Judge


Problem Description
Oipotato loves his girlfriend very much. Since Valentine's Day is coming, he decides to buy some presents for her.

There are $n$ presents in the shop, and Oipotato can choose to buy some of them. We know that his girlfriend will possibly feel extremely happy if she receives a present. Therefore, if Oipotato gives $k$ presents to his girlfriend, she has $k$ chances to feel extremely happy. However, Oipotato doesn't want his girlfriend to feel extremely happy too many times for the gifts.

Formally, for each present $i$, it has a possibility of $P_i$ to make Oipotato's girlfriend feel extremely happy. Please help Oipotato decide what to buy and maximize the possibility that his girlfriend feels extremely happy for exactly one time.
 

Input
There are multiple test cases. The first line of the input contains an integer $T~(1 \le T \le 100)$, indicating the number of test cases. For each test case:

The first line contains an integer $n~(1 \le n \le 10\ 000)$, indicating the number of possible presents.

The second line contains $n$ decimals $P_i~(0 \le P_i \le 1)$ with exactly six digits after the decimal point, indicating the possibility that Oipotato's girlfriend feels extremely happy when receiving present $i$.

It is guaranteed that the sum of $n$ in all test cases does not exceed $450\,000$.
 

Output
For each test case output one line, indicating the answer. Your answer will be considered correct if and only if the absolute error of your answer is less than $10^{-6}$.
 

Sample Input
2 3 0.100000 0.200000 0.900000 3 0.100000 0.300000 0.800000
 

Sample Output
0.900000000000 0.800000000000
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-03-29 14:53:37, Gzip enabled