codeforces 101A HOME 排序_she offered the students a string consisting of n -CSDN博客

本文链接：https://blog.csdn.net/qiuxueming_csdn/article/details/48222665

Description

Once when Gerald studied in the first year at school, his teacher gave the class the following homework. She offered the students a string consisting ofn small Latin letters; the task was to learn the way the letters that the string contains are written. However, as Gerald is too lazy, he has no desire whatsoever to learn those letters. That's why he decided to lose some part of the string (not necessarily a connected part). The lost part can consist of any number of segments of any length, at any distance from each other. However, Gerald knows that if he loses more thank characters, it will be very suspicious.

Find the least number of distinct characters that can remain in the string after no more thank characters are deleted. You also have to find any possible way to delete the characters.

Input

The first input data line contains a string whose length is equal to n (1 ≤ n ≤ 10⁵). The string consists of lowercase Latin letters. The second line contains the numberk (0 ≤ k ≤ 10⁵).

Output

Print on the first line the only number m — the least possible number of different characters that could remain in the given string after it loses no more thank characters.

Print on the second line the string that Gerald can get after some characters are lost. The string should have exactlym distinct characters. The final string should be the subsequence of the initial string. If Gerald can get several different strings with exactlym distinct characters, print any of them.

Sample Input

Input

aaaaa
4

Output

1
aaaaa

Input

abacaba
4

Output

1
aaaa

Input

abcdefgh
10

Output

Sample Output

Hint

In the first sample the string consists of five identical letters but you are only allowed to delete 4 of them so that there was at least one letter left. Thus, the right answer is 1 and any string consisting of characters "a" from 1 to 5 in length.

In the second sample you are allowed to delete 4 characters. You cannot delete all the characters, because the string has length equal to 7. However, you can delete all characters apart from "a" (as they are no more than four), which will result in the "aaaa" string.

In the third sample you are given a line whose length is equal to 8, and k = 10, so that the whole line can be deleted. The correct answer is 0 and an empty string.

题意：好难懂的题意，对英语渣来说简直是天书啊，题目就是给定一串字符，让你删除最多k个，使得留下来的字符的种类最少的问题。

思路：统计各个字符的个数，然后进行排序（升序），然后删掉总数<=k的所有字符按原来的字符顺序输出；

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct point {
int sum;
char c;
};
point po[27];
char a[100010];
int k;
int tol;

int cmpsum(point a,point b){
    return a.sum<b.sum;
}
int main(){
    while(~scanf("%s",a)){
            scanf("%d",&k);
            memset(po,0,sizeof(po));
        int len=(int)strlen(a);
        int le=len;
        for(len=len-1;len>=0;len--){
            po[a[len]-'a'].sum++;
            po[a[len]-'a'].c= a[len];
        }//统计
        sort(po,po+26,cmpsum);//排序
        tol=0;
        int i;
        for(i=0;i<26;i++){
            if(po[i].sum==0){continue;}
            tol+=po[i].sum;
            if(tol<=k){
                for(int j=0;j<le;j++){
                    if(a[j]==po[i].c){
                        a[j]='0';
                    }
                }
            }
            if(tol>k){break;}
        }//删除字符
        printf("%d\n",26-i);
        for( int j=0;j<le;j++){
                if(a[j]!='0'){
                 printf("%c",a[j]);
                }
        }
        printf("\n");
    }
    return 0;
}