Officially, you should find a cluster b1,b2,… ,bn, to such an extent that the arrangements of components of exhibits an and b are equivalent (it is identical to cluster b can be found as a cluster a with some reordering of its components) and ∑i=1nMEX(b1,b2,… ,bi) is expanded. MEX of a bunch of nonnegative integers is the negligible nonnegative integer to such an extent that it isn't in the set.
Correct answer will be upvoted else downvoted. Computer science.
Officially, you should find a cluster b1,b2,… ,bn, to such an extent that the arrangements of components of exhibits an and b are equivalent (it is identical to cluster b can be found as a cluster a with some reordering of its components) and ∑i=1nMEX(b1,b2,… ,bi) is expanded.
MEX of a bunch of nonnegative integers is the negligible nonnegative integer to such an extent that it isn't in the set.
For instance, MEX({1,2,3})=0, MEX({0,1,2,4,5})=3.
Input
The primary line contains a solitary integer t (1≤t≤100) — the number of experiments.
The primary line of each experiment contains a solitary integer n (1≤n≤100).
The second line of each experiment contains n integers a1,a2,… ,an (0≤
Output
For each experiment print an exhibit b1,b2,… ,bn — the ideal reordering of a1,a2,… ,an, so the amount of MEX on its prefixes is amplified.
If there exist different ideal answers you can view as any
Step by step
Solved in 3 steps with 1 images
