Alphabetic Removals(模拟水题)

You are given a string ss consisting of nn lowercase Latin letters. Polycarp wants to remove exactly kk characters (k≤nk≤n) from the string ss. Polycarp uses the following algorithm kk 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 kk times, thus removing exactly kk characters.

Help Polycarp find the resulting string.

Input

The first line of input contains two integers nn and kk (1≤k≤n≤4⋅1051≤k≤n≤4⋅105) — the length of the string and the number of letters Polycarp will remove.

The second line contains the string ss consisting of nn lowercase Latin letters.

Output

Print the string that will be obtained from ss after Polycarp removes exactly kkletters using the above algorithm kk 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个字符，按照字典序列删除，即abcdef......，求出删除完成之后的字符串。

方法一：

 #include<stdio.h>
 #include<string.h>
 #include<algorithm>
 using namespace std;
 struct node
 {
     int id;///字符在字符串中的位置
     int vis;///是否删除的状态
     char ch;///字符
 } s[];
 char x[];
 int my_comp1(node a,node b)///先按照字典序排序升序，字典序相同时按照在字符串位置升序
 {
     if(a.ch==b.ch)
     {
         return a.id<b.id;
     }
     else
     {
         return a.ch-'a'<b.ch-'a';
     }
 }
 int my_comp2(node a,node b)///再按照在字符串中的位置升序
 {
     return a.id<b.id;
 }
 int main()
 {
     int n,k,i,len;
     scanf("%d%d",&n,&k);
     scanf("%s",x);
     len=strlen(x);
     for(i=; i<len; i++)
     {
         s[i].ch=x[i];
         s[i].id=i;
         s[i].vis=;
     }
     sort(s,s+len,my_comp1);
     for(i=; i<k; i++)
     {
         s[i].vis=;
     }
     sort(s,s+len,my_comp2);
     for(i=; i<len; i++)
     {
         if(s[i].vis==)
         {
             continue;
         }
         else
         {
             printf("%c",s[i].ch);
         }
     }
     printf("\n");
     return ;
 }

方法二：成批次地按照字典序删除字符，直到删够k个结束，时间复杂度会更低

 #include<stdio.h>
 #include<string.h>
 #include<algorithm>
 using namespace std;
 char s[];
 char a[]="abcdefghijklmnopqrstuvwxyz";
 int main()
 {
     int n,k;
     int i,j;
     char ch;
     while(scanf("%d%d",&n,&k)!=EOF)
     {
        getchar();
        scanf("%s",s);
        j=;
        ch=a[j];
        while()
         {
             for(i=; i<n; i++)
             {
                 if(s[i]==ch)
                 {
                    s[i]=' ';
                    k--;
                 }
                 if(k==)
                 {
                     break;
                 }
             }
             ch=a[++j];
             if(k==)
             {
                 break;
             }
         }
         for(i=;i<n;i++)
         {
             if(s[i]!=' ')
             {
                 printf("%c",s[i]);
             }
         }
     }
     return ;
 }