9.10 中国电信it研发中心 笔试编程题

A
题意: 假设字符串中出现次数最少的字母是x, 出现次数为y, 删除所有出现次数为y的字符
思路: 统计一下字符的出现次数, 然后照着做就行

#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#include <map>
#include <set>
#include <cstdio>
#include <sstream>
#include <cctype>

#define LL long long
#define mst(a, b)   memset(a, b, sizeof(a))
#define pill pait<int, int> 
#define ft first
#define sd second

using namespace std;

const int qq = 3e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 10;
int vis[300];
char s[qq];


int main() {
    string x;   cin >> x;
    int minx = INF;
    for (int i = 0; i < x.size(); ++i) {
        vis[x[i]]++;
    }
    string ans = "";
    for (int i = 0; i < x.size(); ++i) {
        if (vis[x[i]] > 0)  minx = min(minx, vis[x[i]]);
    }
    for (int i = 0; i < x.size(); ++i) {
        if (minx == vis[x[i]])  c