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

#include<stdio.h>
#include<string.h>
#include<math.h>
char s[400005]; 
int main()
{
	long long j,n,k;
	char i;
	scanf("%lld%lld",&n,&k);
	getchar();
	gets(s);

	for(i='a'; i<='z'; ++i)
	{
		for(j=0; j<n; ++j)
		{
			if(k==0)	//k代表操作数，为0则停。
				break;
			if(s[j]==i)
			{
				k--;
				s[j]='0';
			}		
		}
		if(k==0)
			break;
	}
	for(j=0; j<n; ++j)
	{
		if(s[j]!='0')
			printf("%c",s[j]);
	}
		
	
	return 0;
}