HDU 6351(多校第五场1002)

死在贪心，原来是暴搜

#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <list>
#define INF 0x3f3f3f3f
#define maxn 105000
#define maxnn 6000
#define juzheng 300
#define line cout << "-------------------------" << endl;
#define PI acos(-1.0)
#define mem(a,b) memset(a,b,sizeof(a))
#define fill_(a,b,n) fill(a,a + n,b)
#define esp 1e-9
 
#define ri(n) scanf("%d",&n)
#define ri2(a,b) scanf("%d %d",&a,&b)
#define ri3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define rd(n) scanf("%lf",&n)
#define rd2(a,b) scanf("%lf %lf",&a,&b)
#define rd3(a,b,c) scanf("%lf %lf %lf",&a,&b,&c)
#define rl(n) scanf("%lld",&n)
#define rl2(a,b) scanf("%lld %lld",&a,&b)
#define rl3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define rs(str) scanf("%s",str)
#define pr(n) cout << n << endl
#define ll long long
#define int64 __int64

using namespace std;

const ll mod = 1e9 + 7;

//Date:2018-8-6
//Author：HarryBlackCat

int temp[maxn],b[maxn],n,k,counter,min2,max2;

void init(){
	mem(temp,0);
	mem(b,0);
	counter = 0;
	min2 = INF;
	max2 = -INF;
}

void dfs(int index,int step){
	//剪枝 
	if(index >= counter)//超过长度,return 
		return;
	if(step > k)//超过次数,return 
		return;
	if(b[0] == 0)//前导0,return 
		return;
	
	int sum = 0;
	for(int i = 0;i < counter;i++)
		sum = sum * 10 + b[i];//交换后取值 
	
	min2 = min(min2,sum);//取最小值 
	max2 = max(max2,sum);//取最大值 
	for(int i = index;i < counter;i++){//遍历index后面的每一位 
		swap(b[index],b[i]);//交换 
		if(index == i)//自己时没有步数所以继续向下搜索 
			dfs(index + 1,step);
		else//下一位步数加1 
			dfs(index + 1,step + 1);
		swap(b[index],b[i]);//换回来继续搜索 
	}
	
	return;
}

int main() {
	//cin.sync_with_stdio(false);//降低cin，cout时间
	int t;
	while(~ri(t)){
		while(t--){
			init();
			
			ri2(n,k);
			
			while(n){
				temp[counter++] = n % 10;
				n /= 10;
			}//获取每一位 
			
			for(int i = 0;i < counter;i++)
				b[i] = temp[counter - i - 1];//颠倒过来 
				
			dfs(0,0);//暴搜 
			
			printf("%d %d\n",min2,max2);
		}
	}
	return 0;
}