Greatest Number

CodeChefOpen on judge ↗

Rohan and your friend had given a task of making a integer larger by swapping the adjacent digits of the integer $n$. It is given that the integer is positive and without leading zeroes. You can swap the operation at most $k$ times Help your friend to solve this task!! ### Input - The First line of the input contains $T$ testcases. - The Next line line contains two integers n and k. ### Output

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI