CodeForces 118C 【模拟】

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const int N=1e4+10;
int n,k;
char s[N],ss[N];
int num[19];
int cnt[19],len;
int all[N][15];

void solve(int x)
{
	int sum;
	for(int i=0;i<len;i++)
	{
		int e=s[i]-'0';
		if(cnt[e])
		{
			if(e>x)//5->3
			{
				cnt[e]--;
				ss[i]=x+'0';
			}
			else//3->5
			{
				if((i-1>=0&&(all[len-1][e]-all[i-1][e])<=cnt[e])||(i==0&&all[len-1][e]<=cnt[e]))
				{
					ss[i]=x+'0';
					cnt[e]--;
				}
				else
					ss[i]=s[i];
			}
		}
		else
			ss[i]=s[i];
	}
	ss[len]='';
}

char sss[N];
void solve2(int x)
{
	int sum;
	for(int i=0;i<len;i++)
	{
		int e=s[i]-'0';
		if(cnt[e])
		{
			if(e>x)//5->3
			{
				cnt[e]--;
				sss[i]=x+'0';
			}
			else//3->5
			{
				if((i-1>=0&&(all[len-1][e]-all[i-1][e])<=cnt[e])||(i==0&&all[len-1][e]<=cnt[e]))
				{
					sss[i]=x+'0';
					cnt[e]--;
				}
				else
					sss[i]=s[i];
			}
		}
		else
			sss[i]=s[i];
	}
	sss[len]='';
}

int main()
{
	scanf("%d%d",&n,&k);
	scanf("%s",s);
	len=strlen(s);
	memset(all,0,sizeof(all));
	memset(num,0,sizeof(num));
	for(int i=0;i<len;i++)
	{
		int x=s[i]-'0';
		if(i==0)
			all[i][x]=1;
		else
		{
			for(int kk=0;kk<=9;kk++){
				if(kk==x)
					all[i][x]=all[i-1][x]+1;
				else
					all[i][kk]=all[i-1][kk];
			}
		}
		num[x]++;
	}

	int ans=0x3f3f3f3f;
	for(int i=0;i<=9;i++)
	{
//		printf("%dn",num[i]);
		int res=0;
		int sum=num[i];
		int t=1;
		memset(cnt,0,sizeof(cnt));
		if(sum>=k)
		{
			ans=0;
			strcpy(ss,s);
			break;
		}
		while(sum<k&&(i+t<=9||i-t>=0))
		{
			if(i+t<=9)
			{
				if(num[i+t]+sum>=k)
				{
					cnt[i+t]=k-sum;
					res+=(k-sum)*t;
					if(ans>res)
					{
						solve(i);
						ans=res;
						//printf("%d %dn",i,ans);
					}
					else if(ans==res)
					{
						solve2(i);
						if(strcmp(ss,sss)>0)
							strcpy(ss,sss);
					}
					sum=k;
				}
				else
				{
					res+=num[i+t]*t;
					sum+=num[i+t];
					cnt[i+t]=num[i+t];
				}
			}
			if(i-t>=0)
			{
				if(num[i-t]+sum>=k)
				{
					cnt[i-t]=k-sum;
					res+=(k-sum)*t;
					if(ans>res)
					{
						solve(i);
						ans=res;
						//printf("%d %dn",i,ans);
					}
//					else if(ans==res)
//					{
//						solve2(i);
//						if(strcmp(ss,sss)>0)
//							strcpy(ss,sss);
//					}
					sum=k;
				}
				else
				{
					res+=num[i-t]*t;
					sum+=num[i-t];
					cnt[i-t]=num[i-t];
				}
			}
			t++;
		}
	}
	printf("%dn",ans);
	printf("%sn",ss);
	return 0;
}
/*
16 14
6124258626539246

22
4124248424439244
*/