Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6381 |

@blackshadows | 6329 |

@mb1973 | 5388 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3357 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@1905439 | 553 |

@terabaap123 | 508 |

@smitadiwedi1991 | 279 |

@DevanandJayakumar | 250 |

@atishagusain | 244 |

@gupta_10 | 226 |

@nipun edara | 224 |

@shubhamkhullar7 | 224 |

@sharmachandan487 | 204 |

@balunagar | 204 |

@arshjit_singh7 | 190 |

Complete Leaderboard |

Given an array **arr **of integers of size **N** and an integer **K**, the task is to find the **K distinct** larger values of the array**. **If there are less than **K distinct** values in the array print **-1**.

**Input: **

1. The first line of the input contains a single integer* * **T** denoting the number of test cases. The description of **T** test cases follows.

2. The first line of each test case contains two space-separated integers **N** and **K**

3. The second line contains **N** space-separated positive integers represents array **arr**.

**Output:** For each test case, print **K** space-separated values in decreasing order

**Constraints:**

1. 1 <= T <= 10

2. 1 <= K <= N <= 100000

3. 1 <= arr[i] <= 10^9

**Example:
Input:**

3

3 2

4 1 3

4 3

4 8 1 8

4 4

4 8 1 8

**Output:**

4 3

8 4 1

-1

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
K larger values ||

...