[SWEA] 1244. 최대상금

#include<iostream>
#include <queue>
#include <set>
using namespace std;

int main(int argc, char** argv)
{
	int test_case;
	int T;
	cin>>T;
	for(test_case = 1; test_case <= T; ++test_case)
	{

		char t;
    	int K;
    	string str, ans = "0";
    	queue<string> q;

    	cin >> str >> K;

    	q.push(str);

    	for (int i = 0; i < K; i++)
    	{
        	set<string> s;
        	int qSize = q.size();

        	for (int j = 0; j < qSize; j++)
        	{
            	str = q.front();
            	q.pop();

            	if (s.count(str) == 1) continue;
            	s.insert(str);

            	for (int k = 0; k < str.size() - 1; k++)
            	{
                	for (int l = k + 1; l < str.size(); l++)
                	{
                    
                    	if (k == 0 && str[l] == '0') continue;

                    	t = str[k];
                    	str[k] = str[l];
                    	str[l] = t;

                    	q.push(str);

                    	t = str[k];
                    	str[k] = str[l];
                    	str[l] = t;
                	}
            	}
        	}
    	}

    	while (!q.empty())
    	{
        	ans = max(ans, q.front());
        	q.pop();
    	}
		
        cout<<"#"<<test_case<<" "<<ans<<endl;

	}
	return 0;
}