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
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int minn;
int main (void)
{
int n;
string a;
int b,k;
int kase;
cin>>n;
while(n--)
{
cin>>a;
cin>>b;
int len=a.length();
kase=0;
for(int i=0;i<len;i++)
{
if(kase>=b)
break;
minn='9'+1;
for(int j=len-1;j>=i;j--)
{
if(minn>a[j]&&(a[j]!='0'||i))
{
minn=a[j];
k=j;
}
}
if(a[i]>a[k])
{
swap(a[i],a[k]);
++kase;
}
}
cout<<a<<endl;
}
return 0;
}