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 |

@shubhamkhullar7 | 224 |

@nipun edara | 224 |

@balunagar | 204 |

@sharmachandan487 | 204 |

@arshjit_singh7 | 190 |

Complete Leaderboard |

Geek hosted a contest and N students participated in it. The score of each student is given by an integer array arr. The task is to print the number of each student (indexes) in the order they appear in the scoreboard. A student with a maximum score appears first. If two people have the same score then higher indexed student appears first.

**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 a single integer** N****.**

3. The next line contains **N** space-separated integers.

**Output:** For each test case, print the order they appear in the scoreboard

**Constraints:**

1. 1 <= T <= 100

2. 1 <= N <= 10^{4}

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

**Example:
Input:**

2

5

450 230 730 230 150

3

500 500 500

**Output:**

3 1 4 2 5

3 2 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
Geek and Contest ||

...