﻿ Fuzhou University OnlineJudge ﻿  Problem 2111 Min Number

## Problem Description

Now you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i<j≤|n|, here |n| means the length of n’s 10-base notation. Then we can swap n[i] and n[j].

For example, n=9012, we choose i=1, j=3, then we swap n and n, then we get 1092, which is smaller than the original n.

Now you are allowed to operate at most M times, so what is the smallest number you can get after the operation(s)?

## Input

The first line of the input contains an integer T (T≤100), indicating the number of test cases.

Then T cases, for any case, only 2 integers n and M (0≤n<10^1000, 0≤M≤100) in a single line.

## Output

For each test case, output the minimum number we can get after no more than M operations.

## Sample Input

3 9012 0 9012 1 9012 2

9012 1092 1029

## Source

“高教社杯”第三届福建省大学生程序设计竞赛

Submit  Back  Status  Discuss 