← 返回题目

题库练习 Fancy Number

← 上一题下一题 →

A8364 | $Fancy Number$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

A car number in Berland consists of exactly $n$ digits. A number is called beautiful if it has at least $k$ equal digits. Vasya wants to change the digits in his car's number so that the number became beautiful. To replace one of $n$ digits Vasya has to pay the sum of money, equal to the absolute difference between the old digit and the new one. Help Vasya: find the minimum sum of money he should pay to make the number of his car beautiful. You should also find the resulting beautiful number. If there are several such numbers, then print the lexicographically minimum one.

输入格式

The first line contains two space-separated integers $n$ and $k$ ( $2<=n<=10^{4},2<=k<=n$ ) which represent how many digits the number has and how many equal digits a beautiful number should have. The second line consists of $n$ digits. It describes the old number of Vasya's car. It is guaranteed that the number contains no spaces and only contains digits.

输出格式

On the first line print the minimum sum of money Vasya needs to change the number. On the second line print the car's new number. If there are several solutions, print the lexicographically minimum one.

输入输出样例

输入 #1

6 5
898196

输出 #1

4
888188

输入 #2

3 2
533

输出 #2

0
533

输入 #3

10 6
0001112223

输出 #3

3
0000002223

C++ 编辑器

输入

输出