Associated Course(s):
Sudo Placement 2

Given an array of **N** distinct elements, the task is to find all elements in array except two greatest elements.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. Each test case contains two lines. The first line of input contains an integer N denoting the size of the array. Then in the next line are N space separated array elements.

**Output:**

For each test case in a new line print the space separated sorted values denoting the elements in array which have at-least two greater elements than themselves.

**Constraints:**

1<=T<=100

3<=N<=100

1<=A[]<=100

**Example:
Input:**

2

5

2 8 7 1 5

6

7 -2 3 4 9 -1

**Output:**

1 2 5

-2 -1 3 4

**Explanation:**

**Testcase 1:** Largest two elements are 7 and 8. So array left is 1 2 5.

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

saiujwal13083 | 347 |

isiddhisingh | 252 |

Abhishek_Jadhav | 243 |

_uncle_sam_ | 221 |

c_ocoooo | 217 |

saiujwal13083 | 610 |

SumitSingh27 | 466 |

c_ocoooo | 456 |

rathiarpit29 | 379 |

NaveenKumarNakka | 370 |

blackshadows | 5362 |

Ibrahim Nash | 5242 |

akhayrutdinov | 5111 |

mb1973 | 4931 |

Quandray | 4598 |

Login to report an issue on this page.