Submission #73687285

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;
using ll = long long;
using pll = pair<ll, ll>;
const int inf = 1073741823;
const long long INF = 1LL << 60;
#define el '\n'
#define spa " "
#define pb emplace_back
#define rep(i, s, n) for(int i = (s); i < (int)(n); i++)
#define rrep(i, s, n) for(int i = (int)(n) - 1; i >= (s); i--)
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define unless(c) if(!(c))
#define until(c) while(!(c))

int sub(){
    return 0;
}

int solve() {
    string s;
    cin >> s;
    vector<pll> a(123);
    rep(i, 97, 123){
        a[i].second = i;
    }
    for(int x : s){
        a[x].first++;
    }
    sort(rall(a));
    set<int>c;
    c.insert(a[0].second);
    rep(i, 0, 123){
        if(a[0].first > a[i].first){
            break;
        }
        else{
            c.insert(a[i].second);
        }
    }
    bool ss = false;
    for(int x: s){
        bool t = true;
        for(int y: c){
            if(x == y){
                t = false;
                break;
            }
        }
        if(t){
            cout << (char)x;
            ss = true;
        }
    }
    if(ss)cout << el;
    return 0;
}

int main() {
    int t = 1;
    // cin >> t;
    rep(i, 0, t) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result