305258: CF999C. Alphabetic Removals
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:26
Solved:0
Description
Alphabetic Removals
题目描述
You are given a string $ s $ consisting of $ n $ lowercase Latin letters. Polycarp wants to remove exactly $ k $ characters ( $ k \le n $ ) from the string $ s $ . Polycarp uses the following algorithm $ k $ times: - if there is at least one letter 'a', remove the leftmost occurrence and stop the algorithm, otherwise go to next item; - if there is at least one letter 'b', remove the leftmost occurrence and stop the algorithm, otherwise go to next item; - ... - remove the leftmost occurrence of the letter 'z' and stop the algorithm. This algorithm removes a single letter from the string. Polycarp performs this algorithm exactly $ k $ times, thus removing exactly $ k $ characters. Help Polycarp find the resulting string.输入输出格式
输入格式
The first line of input contains two integers $ n $ and $ k $ ( $ 1 \le k \le n \le 4 \cdot 10^5 $ ) — the length of the string and the number of letters Polycarp will remove. The second line contains the string $ s $ consisting of $ n $ lowercase Latin letters.
输出格式
Print the string that will be obtained from $ s $ after Polycarp removes exactly $ k $ letters using the above algorithm $ k $ times. If the resulting string is empty, print nothing. It is allowed to print nothing or an empty line (line break).
输入输出样例
输入样例 #1
15 3
cccaabababaccbc
输出样例 #1
cccbbabaccbc
输入样例 #2
15 9
cccaabababaccbc
输出样例 #2
cccccc
输入样例 #3
1 1
u
输出样例 #3
Input
暂时还没有翻译
Sample Input Copy
Sample Output Copy
HINT
从左往右依次删除k个字典序最小的字符,结果是什么?