zoukankan      html  css  js  c++  java
  • CodeForces

    You are given a string ss consisting of nn lowercase Latin letters. Polycarp wants to remove exactly kkcharacters (knk≤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 (1kn41051≤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 kk letters 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

    删字母

    自认为代码写的还算优美(嘻嘻)

    #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('
    ');
    
        return 0;
    }
    View Code
  • 相关阅读:
    Node.js 回调函数
    算法二、
    一、Perfect Squares 完全平方数
    Never Go Away
    python 内置方法
    web框架详解之tornado 三 url和分页
    web框架详解之tornado 二 cookie
    前端各种插件
    AJAX请求时status返回状态明细表
    LR之-参数化
  • 原文地址:https://www.cnblogs.com/daybreaking/p/9351470.html
Copyright © 2011-2022 走看看