Problem LinkAuthor: Praveen Dhinwa Tester: Pawel Kacprzak and Misha Chorniy Editorialist: Bhuvnesh Jain DifficultyEASY PrerequisitesGreedy, Sorting, Median ProblemYou are given an array $A$ of size $2 * N$ consisting of positive integers, where $N$ is an odd number. You can construct an array $B$ from $A$ as follows, $B[i] = max(A[2 * i  1], A[2 * i])$. Consider all permutations of $A$. Print any one of them which maximises the median of $B$ ExplanationThe larger elements we have in the array $B$, the larger will be its median. Since, array $B$ has $n$ elements only, we would like to have the largest $n$ elements of $A$ somehow, go into the array $B$. Let us assume we have a black box which permutes array $A$ in some manner such that the largest $n$ elements go into array $B$. Now, what will be the median of array $B$ in such a case? It will be simply the middle element once the array $B$ is sorted. Now, let us describe the black box now. We see that elements of $B$ are from adjacent elements from $A$. i.e. they are independent of each other in their selection. Thus, we simply put all the highest $n$ elements in either odd or even positions in array $A$. This will ensure that are always selected into array $B$. So, the only requirement is to sort the array $A$ to get the highest $n$ elements. The sorting can be done using mergesort, randomised quicksort or any inbuilt sort function available. The above is just one of the methods to construct the array and solve the problem. Multiple solutions to the problem might exist. Feel free to discuss them below. Time Complexity$O(n \log{n})$ per test case Solution Links
This question is marked "community wiki".
asked 18 May '17, 13:46

My solution is almost similar to the Editorialist solution but i got WA where am i wrong https://www.codechef.com/viewsolution/13499478 answered 18 May '17, 17:15
Your answer is correct, but the array required to give that answer is is incorrect, after sorting your array would look lie
(18 May '17, 17:53)

@divik544 You sorted the initial array, but you forgot to permute it! Remember, you need max elements in each adjacent pair of elements. If the array is a0, a1, a2, a4, ... a(2n1) after sorting. A valid permutation would be: a0, an, a1, a(n+1), ... a(n1), a(2n1) after which the B array becomes an, a(n+1), a(n+2), ... a(2n1) and the median would be a[(3n1)/2] that is, [(n) + (2n1)]/2. Here's my solution answered 18 May '17, 17:39

Could someone please explain how we are saving time through this in programs? As I am new to programming. answered 10 Jun '17, 14:21
How do you edit code to preview in readable format @vijju123 ?
(10 Jun '17, 14:48)
1
Copy paste the entire code, then select it, and THEN click "Enter code" (Make sure to give atleast 1 space to code from any sentence before or after the code, else it wont have any effect) Eg
(10 Jun '17, 14:51)
Thanks mate ! ^^
(10 Jun '17, 14:58)
@adiaspirant, we just saving some tying time by these statements and nothing else. The ifndef statement just helps us to execute the code directly from sublime text without going to the terminal again and again. The ifndef statement will only work when the "ONLINE_JUDGE" flag is defined while compilation which can be seen on the specific websites.
(17 Jun '17, 14:03)

Setter & Tester solution links not yet updated :( answered 10 Jun '17, 14:35

please check this code https://www.codechef.com/viewsolution/14267962 answered 17 Jun '17, 10:19
