Submission #73687186

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<int,char> pic;
typedef vector<int> vi;
#define SZ(x) ((int)x.size())
const int mod = 1e9+7;
const int P = 998244353;

int n;
char s[110];
pii b[1000];
int a[110],len = 0;
int main() {
	cin >> s;
	n = strlen(s);
	for (int i = 0;i < n;i++){
		b[s[i]-'a'+1].first++;
		b[s[i]-'a'+1].second = s[i];
	}
	sort(b+1,b+26+1);
	a[++len] = b[int(26)].second;
	for (int i = 25;i >= 1;i--){
		if (b[i].first == b[i+1].first){
			//cout << 1;
			a[++len] = b[i].second;
		}
		else {
			break;
		}
	}
	for (int i = 0;i < n;i++){
		bool t = true;
		for (int j = 1;j <= len;j++){
			if (a[j] == s[i]){
				t = false;
			}
		}	
		if (t){
			printf("%c",s[i]);
		}
	}


    return 0;
}

Submission Info

Judge Result