Too Mean CodeChef Solution | CodeChef Problem Solution 2022

Too Mean CodeChef Solution | CodeChef Problem Solution 2022

You are given an array A$A$ of length N$N$.

You have to partition the elements of the array into some subsequences such that:

• Each element Ai$A_i$ (1≤i≤N)$(1\le i\le N)$ belongs to exactly one subsequence.
• The mean of the mean of subsequences is maximised.

Formally, let S1,S2,…,SK$S_1,S_2,\dots ,S_K$ denote K$K$ subsequences of array A$A$ such that each element Ai$A_i$ (1≤i≤N)$(1\le i\le N)$ belongs to exactly one subsequence Sj$S_j$ (1≤j≤K)$(1\le j\le K)$.
Let Xj$X_j$ (1≤j≤K)$(1\le j\le K)$ denote the mean of the elements of subsequence Sj$S_j$. You need to maximise the value ∑Kj=1XjK$\frac{\sum _{j=1}^K{X}_j}{K}$.

Solution Click Below:-  CLICK HERE

Print the maximum value. The answer is considered correct if the relative error is less than 10−6${10}^{-6}$.

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.

Roller Coaster CodeChef Solution | CodeChef Problem Solution 2022

The Mango Truck CodeChef Solution | CodeChef Problem Solution 2022

Laptop Recommendation CodeChef Solution | CodeChef Problem Solution 2022

Infernos CodeChef Solution | CodeChef Problem Solution 2022

Beat the Average CodeChef Solution | CodeChef Problem Solution 2022

Maximum OR Minimum CodeChef Solution | CodeChef Problem Solution 2022

Dazzling Even-Odd Challenge CodeChef Solution 

Too Mean CodeChef Solution | CodeChef Problem Solution 2022

• First line of each test case consists of a single integer N$N$ - denoting the length of array A$A$.
• Second line of each test case consists of N$N$ space-separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$ - denoting the array A$A$.

Output Format

For each test case, output in a single line, the maximum possible mean of mean of subsequences. The answer is considered correct if the relative error is less than 10−6${10}^{-6}$.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 2≤N≤105$2\le N\le {10}^5$
• 1≤Ai≤106$1\le A_i\le {10}^6$
• Sum of N$N$ over all test cases does not exceed 3⋅105$3\cdot {10}^5$.

Sample Input 1 

3
2
10 20
3
1 2 3
5
50 50 50 50 50

Sample Output 1 

15
2.25
50

Explanation

Test Case 1$1$: We can partition the array in 2$2$ ways - ({10},{20})$(\{10\},\{20\})$ or ({10,20})$(\{10,20\})$. In both cases, mean of mean of subsequences comes out to be 15$15$.

Test Case 2$2$: The optimal partition is ({1,2},{3})$(\{1,2\},\{3\})$.

• Mean of first subsequence =1+22=1.5$=\frac{1+2}{2}=1.5$.
• Mean of second subsequence =31=3$=\frac{3}{1}=3$.

Thus, mean of mean of subsequences is 1.5+32=4.52=2.25$\frac{1.5+3}{2}=\frac{4.5}{2}=2.25$.

Test Case 3$3$: Any partition will yield the mean of mean of subsequences as 50$50$.

Join Now for Solution:-