← 返回题目

题库练习 [COCI-2011_2012-contest4]#2 KEKS

← 上一题下一题 →

A1231 | $[COCI-2011_2012-contest4]#2 KEKS$

来源COCI

时间限制1s

内存限制128MB

通过 / 提交0/0

题目描述

Mirko and Slavko are bored at math class again so they came up with new game. Mirko writes down an N digit number, and Slavko’s task is to obtain the largest possible number after having removed exactly K digits. Help him do that!

输入格式

The first line of input contains integers N and K (1 \leq K < N \leq 500 000). The following line contains N digit number. This number starts with non-zero digit.

输出格式

The first and only line of output should contain the largest possible number Slavko can obtain by removing K digits from the given number.

输入输出样例

输入 #1

4 2
1924

输出 #1

输入 #2

7 3
1231234

输出 #2

输入 #3

10 4
4177252841

输出 #3

C++ 编辑器

输入

输出