← 返回题目

题库练习 Ania and Minimizing

← 上一题下一题 →

A12907 | $Ania and Minimizing$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Ania has a large integer $S$ . Its decimal representation has length $n$ and doesn't contain any leading zeroes. Ania is allowed to change at most $k$ digits of $S$ . She wants to do it in such a way that $S$ still won't contain any leading zeroes and it'll be minimal possible. What integer will Ania finish with?

输入格式

The first line contains two integers $n$ and $k$ ( $1 \leq n \leq 200\,000$ , $0 \leq k \leq n$ ) — the number of digits in the decimal representation of $S$ and the maximum allowed number of changed digits. The second line contains the integer $S$ . It's guaranteed that $S$ has exactly $n$ digits and doesn't contain any leading zeroes.

输出格式

Output the minimal possible value of $S$ which Ania can end with. Note that the resulting integer should also have $n$ digits.

输入输出样例

输入 #1

5 3
51528

输出 #1

输入 #2

3 2
102

输出 #2

输入 #3

1 1
1

输出 #3

C++ 编辑器

输入

输出