Submission

Score: 100

User: Evil_Guest

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-12 01:38:30

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

int main(){
    string s;
    cin>>s;
    vector<char>up;
    vector<char>low;
    for(char l:s){
        if(l>='A' && l<='Z' && up.empty())up.push_back(l);
        else if(l>='A' && l<='Z'){
            bool isPresent=false;
            for(char x:up){
                if(l==x){
                    isPresent=true;
                    break;
                }
            }
            if(!isPresent)up.push_back(l);
        }
        else if(l>='a' && l<='z' && low.empty())low.push_back(l);
        else if(l>='a' && l<='z'){
            bool isPresent=false;
            for(char x:low){
                if(l==x){
                    isPresent=true;
                    break;
                }
            }
            if(!isPresent)low.push_back(l);
        }
    }
    sort(up.begin(),up.end());
    sort(low.begin(),low.end());
    for(char i:up)cout<<i<<' ';
    for(char i:low)cout<<i<<' ';
}