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.

:)) | 197 |

Change_UserHandle | 183 |

shivam2303 | 180 |

PankajChhabra1 | 180 |

codifica_amante | 165 |

KapilChhipa | 588 |

sagarsagar | 502 |

mb1973 | 482 |

AmanDeepSingh97 | 473 |

shivam2303 | 469 |

blackshadows | 5254 |

Ibrahim Nash | 5192 |

akhayrutdinov | 5111 |

Quandray | 4385 |

mb1973 | 3919 |

Login to report an issue on this page.