Submission

Status:

[-SSSSSSSSS]

Score: 0

User: Winzzwz

Problemset: เรียงสตริง

Language: cpp

Time: 0.002 second

Submitted On: 2024-11-10 23:00:17

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
vector <char> hee;
unordered_map <char,bool> mark;
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> s;
    int sz = s.size();
    for (int i = 0; i < sz; i++) {
        if (mark[s[i]]) continue;
        mark[s[i]] = true;
        hee.push_back(s[i]);
    }
    sort(hee.begin(),hee.end());
    for (int i = 0; i < sz; i++) {
        cout << hee[i] << " ";
    }
    return 0;
}