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
题目大意：先输入一个字符串长度，再输入一个要删除的字符数量，删除规则是按照字母表的顺序删，先删a再删b再删c…。对于同一个字母先删最左边的。

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#include <stdlib.h>
#include <queue>
#include <cstdio>
#include <string>
#include <string.h>
#include <math.h>
#define N 400010
using namespace std;
int main()
{
    int n,k;
    cin>>n>>k;
    char s[N],ch='a';
    scanf("%s",s);
    int j=0;
    while(1)
    {
        for(int i=0; i<n; i++)
        {
            if(s[i]==ch)
            {
                s[i]=' ';
                k--;
            }
            if(k==0)
            {
                break;
            }
        }
        ch=ch+1;
        if(k==0)
        {
            break;
        }
    }
    for(int i=0;i<n;i++)
    {
        if(s[i]!=' ')
            cout<<s[i];
    }
    return 0;
}