HDU 6351 Beautiful Now(暴力/搜索)

Problem Description

Anton has a positive integer n , however, it quite looks like a mess, so he wants to make it beautiful after k swaps of digits.
Let the decimal representation of n as (x1x2⋯xm)10 satisfying that 1≤x1≤9 , 0≤xi≤9 (2≤i≤m) , which means n=∑mi=1xi10m−i . In each swap, Anton can select two digits xi and xj (1≤i≤j≤m) and then swap them if the integer after this swap has no leading zero.
Could you please tell him the minimum integer and the maximum integer he can obtain after k swaps?

Input

The first line contains one integer T , indicating the number of test cases.
Each of the following T lines describes a test case and contains two space-separated integers n and k .
1≤T≤100 , 1≤n,k≤109 .

Output

For each test case, print in one line the minimum integer and the maximum integer which are separated by one space.

 

Sample Input

5

12 1

213 2

998244353 1

998244353 2

998244353 3

 

Sample Output

12 21

123 321

298944353 998544323

238944359 998544332

233944859 998544332

题目大意：给出一个数字，和最多能操作的次数。操作：数字2个位上的数互相交换。要求输出在规定操作次数下最大数值和最小数值。

思路：这题不能用贪心，不能用贪心，不能用贪心。反正我怎么贪都过不了，没有考虑暴力，虽然题目给的时间是2500ms，，，事实证明还是暴力大法好啊，该题有2种做法，第一种是用全排列暴力求解，时间大概在2100ms左右，算是卡过，第二种是用搜索来爆搜，减枝后时间能达到0ms或15ms（MD）

全排列做法：用STL中的全排列函数，对原数组进行标记，根据标记来找每一次排列结果的交换次数(不用考虑相同的数应该交换哪一位，因为最后会去最大值和最小值，，，，，真*暴力)

代码如下：(我也要向这种码风靠拢)

#include
#include
#include
#include
#include
#include
#include

爆搜做法： (暂未成功，会补上的，逃~~)