Submission #1766491

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define p(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1<<25

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef long long ll;

int dy[8]={1,1,1,0,0,-1,-1,-1};
int dx[8]={-1,0,1,-1,1,-1,0,1};
struct S{
	int a,b,c;
};
bool asc(const S& left,const S& right){
	return left.c > right.c;
}


int N,K;
string S;
vector<int>cnt(30,0);

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin>>N>>K;
	rep(i,N){
		cin>>S[i];
		cnt[S[i]-'a']++;
	}
	string ans="";
	rep(i,N){
		rep(j,26){
			if(cnt[j]==0)continue;		
			if(S[i]==j+'a'){
				ans+=j+'a';
				cnt[j]--;
				break;
			}
			int cost=0;
			rep(k,i)if(S[k]!=ans[k])cost++; //front
			if(S[i]!=(j+'a'))cost++; //now
			vector<int>cnt2(30,0);
			REP(k,i+1,N)cnt2[S[k]-'a']++;// back
			int tmp=N-i-1;
			rep(k,26){
				if(k==j)tmp-=min(cnt[k]-1,cnt2[k]);
				else tmp-=min(cnt[k],cnt2[k]);
			}
			cost+=tmp;
			if(cost<=K){
				ans+=(j+'a');
				cnt[j]--;
				break;
			}
		}
	}
	P(ans);
	return 0;
}

Submission Info

Judge Result