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 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).

问题分析：

从a到z顺序删除，一直到删除了k个字符为止。输出删除后的字符。

AC代码：

#include <iostream>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<set>
#include<stack>
#include<queue>
using namespace std;const int N = 400005;int main(){ios::sync_with_stdio(false);cin.tie(0);int n,k;string s;cin>>n>>k>>s;int flag[N];memset(flag,1,sizeof(flag));for(int i = 0;i < 26;i++){for(int j = 0;j < s.size();j++){//从a开始删除 if(s[j] == 'a'+i && k > 0){k--;//标记已经删除了的字符 flag[j] = 0;}}}for(int i = 0;i < s.size();i++){if(flag[i]){cout<<s[i];}}cout<<endl;return 0;
}

Alphabetic Removals相关推荐

CoderForces999C-Alphabetic Removals
C. Alphabetic Removals time limit per test 2 seconds memory limit per test 256 megabytes input stand ...
Multimap的遍历和删除（很重要）
c++STL容器中Multimap可允许重复键值元素插入容器,但在遍历的时候出现了一些问题.今天要把他解决掉第一元素是键值,不能修改.第二元素是实值,可以修改. 键值key与元素value的映照关系 ...
Codeforces Round #490 (Div. 3)【完结】
2022.3.3 题单地址:https://codeforces.com/contest/999 目录 A. Mishka and Contest[模拟] B. Reversing Encryptio ...
Codeforces Round #490 (Div. 3)
GET reverse() ve.pop_back() ve.back() A. Mishka and Contest 题意给定一个序列表示题目的难度和Mishka的能力,问Mishka能解决几道问 ...
字符串处理 —— 模拟与暴力
[概述] 在某些题目中,需要对字符串进行处理,不需要很复杂的算法,只需要按照题意进行模拟或暴力枚举即可得出答案. [例题] 1.简单模拟 Minimum Ternary String(CF-1009B ...
周总结2022.1.17-2022.1.23
1.17 Luogu P3384 [模板]轻重链剖分/树链剖分学习了树链剖分(Lint-cut Tree)! 虽然之前也有看过,但是今天是第一次自己动手写.学完之后,感觉是一个非常巧妙的东西.树链剖 ...
python字符串基本形式_python字符串常用方式
class str(basestring): """ str(object='') -> string Return a nice string represent ...
Linux文件分割与合并：splitcat（转载）
转自:http://os.51cto.com/art/201104/255359.htm Linux下文件分割可以通过split命令来实现,而用cat进行文件合并.而分割可以指定按行数分割和安大小分割 ...
ctypealpha php_php ctype函数中文翻译和示例
PHP Ctype扩展是PHP4.2开始就内建的扩展,注意,Ctype系列函数都只有一个字符串类型参数,它们返回布尔值. $str = "0.1123"; //检查字符串所有字符是 ...
Python开发（基础）：字符串
字符串常用方法说明 #!/usr/bin/env python # -*- coding:utf-8 -*- # class str(basestring): # ""&q ...

Alphabetic Removals

Alphabetic Removals相关推荐

最新文章

热门文章