Submission

Score: 0

User: matcherbrainner

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-04 10:12:37

#include <bits/stdc++.h>
using namespace std;

bool compareChar(char a, char b) {
    if (tolower(a) == tolower(b)) {
        return a < b;
    }
    return tolower(a) < tolower(b);
}
int main() {
    string s;
    cin >> s;
    sort(s.begin(), s.end(), compareChar);
    auto it = unique(s.begin(), s.end());
    s.erase(it, s.end());
    for (int i = 0; i < s.size(); i++) {
        cout << s[i] << " ";
    }
    return 0;
}