distinct components in the cluster, add 1 to the first, and take away 1 from the second. In any case, every one of the components of a need to stay non-negative after this activity. What is lexicographically the littlest exhibit you can get? A cluster x is lexicographically
Correct answer will be upvoted else downvoted.
pick 2 distinct components in the cluster, add 1 to the first, and take away 1 from the second. In any case, every one of the components of a need to stay non-negative after this activity.
What is lexicographically the littlest exhibit you can get?
A cluster x is lexicographically more modest than an exhibit y if there exists a list I to such an extent that xi<yi, and xj=yj for all 1≤j<i. Less officially, at the principal list I in which they vary, xi<yi.
Input
The principal line contains an integer t (1≤t≤20) – the number of experiments you really wanted to tackle.
The primary line of each experiment contains 2 integers n and k (2≤n≤100, 1≤k≤10000) — the number of components in the cluster and the greatest number of tasks you can make.
The subsequent line contains n space-isolated integers a1, a2, … , an (0≤
Output
For each experiment, print the lexicographically littlest exhibit you can get after all things considered k tasks.
Step by step
Solved in 3 steps with 1 images
