Alphabetic Removals(思维+模拟)

Alphabetic Removals

You are given a string s consisting of n lowercase Latin letters. Polycarp wants to remove exactly k characters (k≤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.

Input

The first line of input contains two integers n

and k (1≤k≤n≤4⋅105

) — 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.

Output

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).

Examples
Input

15 3
cccaabababaccbc

Output

cccbbabaccbc

Input

15 9
cccaabababaccbc

Output

cccccc

Input

1 1
u

Output

题意：

给了n和k，然后输入一个长度为n的字符串，然后有k次操作，从字符串中依次按abcd…的顺序删除字符，最后输出k次操作后的字符串。

外面的循环用来标记26个英文字母，里面的循环用来遍历字符串，然后就是按照题意那样删除字符了，删除记为0，输出的时候不输出0即可。

code：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int main(){
    int n,k;
    string str;
    cin >> n >> k;
    cin >> str;
    for(int i = 0; i < 26; i++){
        for(int j = 0; j < n && k; j++){
            if(str[j] == 'a' + i){
                str[j] = '0';
                k--;
            }   
        }
    }
    for(int i = 0; i < n; i++){
        if(str[i] != '0') cout << str[i];
    }
    cout << endl;
    return 0;
}