CodeForces - 999C

最新推荐文章于 2018-11-08 16:56:37 发布

weixin_30657541

最新推荐文章于 2018-11-08 16:56:37 发布

阅读量181

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/daybreaking/p/9351470.html

本文介绍了一个简单的算法问题：从一个由小写字母组成的字符串中，根据特定规则删除指定数量的字符，并提供了完整的C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given a string s

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

Help Polycarp find the resulting string.

Input

The first line of input contains two integers n

The second line contains the string s

Output

Print the string that will be obtained from s

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<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<deque>
#include<iostream>
using namespace std;
char con[400009];
int check[200];
int main()
{
    int i,p,j;
    int n,k;
    scanf("%d%d",&n,&k);
    getchar();
    for(i=0;i<n;i++)
    {
        scanf("%c",&con[i]);
        check[con[i]]++;
    }
    con[i]=0;

    for(i='a';i<='z'+10;i++)
    {
        if(k<=0)
            break;
        if(k-check[i]>=0)
            k-=check[i];
        else
        {
            check[i]=k;
            k=0;
        }
    }
    for(;i<='z';i++)
        check[i]=0;

    for(i=0;i<n;i++)
    {
        if(check[con[i]]>0)
        {
            check[con[i]]--;
        }
        else
            printf("%c",con[i]);
    }
    putchar('\n');

    return 0;
}