Submission #1307337

---

Source Code Expand

#include<iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
#define int long long
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)


signed main()
{
	int r, c;
	int sx, sy, gx, gy, x, y, tar_x, tar_y;
	int array1[3];
	int *array2;
	int cc = 0;
	int tmp,max = 0, max2 = 0;
	int num = 0;
	int count;
	char tmpc;
	cin >> sx >> sy;
	vector<char> str,str_sub,str_0;
	str.resize(sx);
	str_sub.resize(sx);
	str_0.resize(sx);
	REP(i, sx){
		cin >> str[i];
		str_sub[i] = str[i];
		str_0[i] = str[i];
	}
	std::sort(str_sub.begin(), str_sub.end());
	
	/*
	REP(i, sx){
		cout << str_sub[i];
	}
	*/
	
	//cout << endl;
	count = 0;
	REP(i, sx){
		FOR(j,count, sx){
			if (str_sub[i] == str[j]){
				num = j;
				cc = 0;
				tmpc = str[j];
				swap(str[num],str[i]);
				REP(k, sx){
					if (str_0[k] != str[k]) cc++;
				}
				if (cc > sy){
					swap(str[num], str[i]);
				}
				else{
					count += 1;
					break;
				}
			}
		}
		/*
		cout << " : ";
		REP(i, sx){
			cout << str[i];
		}
		cout << endl;
		*/
		
	}
	REP(i, sx){
		cout << str[i];
	}
	/*
	cc = 0;
	REP(k, sx){
		if (str_0[k] != str[k]) cc++;
	}
	cout << endl << cc;
	*/
	cout << endl;
	return 0;
}

Submission Info

Judge Result