Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4398 |

@sanjay05 | 3762 |

@mantu_singh | 3654 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 899 |

@akhileshkumar562002 | 862 |

@kanewilliamson123 | 854 |

@pradeeppatidar1999 | 852 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@wallflowe101 | 778 |

Complete Leaderboard |

Geek hosted a coding competition, some of the questions were easy and some of them were hard. You are given an array **arr** of positive integers of size **N** and an integer **K**, **arr[i]** represents the hardness of each problem of geeks' contest. Among those **N** numbers, your task is to find the numbers which appear more than **K** times and print them in increasing order. If no number appears more than **K** times than 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 the maximum number of chocolates you can collect

**Constraints:**

1. 1 <= T <= 10

2. 1 <= K, N <= 100000

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

**Example:
Input:**

3

3 1

5 5 6

6 1

2 2 3 3 4 4

4 2

1 2 2 3

**Output:**

5

2 3 4

-1

**Explanation:**

Test case 1: The only problem with hardness 5 appears more than once

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?

YesLoading...

Kth Frequency

...