All submissions for this problem are available.###Read problems statements [Bengali](http://www.codechef.com/download/translated/LTIME64/bengali/COINPART.pdf) , [Mandarin chinese](http://www.codechef.com/download/translated/LTIME64/mandarin/COINPART.pdf) , [Russian](http://www.codechef.com/download/translated/LTIME64/russian/COINPART.pdf) and [Vietnamese](http://www.codechef.com/download/translated/LTIME64/vietnamese/COINPART.pdf) as well. Chef is a cook. He has a son Chefu and a daughter Chefa. He also has $N$ coins, numbered $1$ through $N$; for each valid $i$, the $i$-th coin has value $V_i$. Chef wants to give all coins to his two children in the following way: He traverses all coins in a particular order; for each coin, he checks which child currently has less money in total and gives this coin to that child (if both have the same amount of money, Chefu is given the coin). Chefu is studying computer science, so he knows that this method is not necessarily the most fair way of partitioning the coins, but Chef does not understand why, since he is only a cook. Now, Chefu wants to take advantage of that and choose the order in which Chef should give out the coins in such a way that the amount of money he gets is maximised. Can you help him? ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $V_1, V_2, \dots, V_N$. ### Output For each test case, print a single line containing $N$ space-separated integers — a permutation of numbers $1$ through $N$ denoting the indices of the coins in the order in which Chef should traverse them. If there is more than one optimal solution, you may print any one. ### Constraints - $1 \le T \le 100$ - $1 \le N \le 500$ - $1 \le V_i \le 500$ for each valid $i$ - the sum of $N$ for all test cases does not exceed $500$ ### Subtasks **Subtask #1 (50 points):** the sum of $N$ for all test cases does not exceed $80$ **Subtask #2 (50 points):** original constraints ### Example Input ``` 2 4 5 3 20 9 4 2 2 2 2 ``` ### Example Output ``` 2 4 1 3 1 2 3 4 ```
|Tags||dynamic-programming, kingofnumbers, knapsack, ltime64, medium-hard, precomputation, proof, taran_1407|
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.