Submission

Score: 0

User: kinzap

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-12 16:14:31

#include <iostream>
#include <queue>
#include <vector>
using namespace std;
priority_queue<char> p;
string n;
string q;
int main(){
    cin >> n;
    for(int i = 0;i<n.length();i++){
        p.push(n[i]);
    }
    // for(int i = p.size();i>0;i--){
    //     cout << p.top() << " ";
    //     p.pop();

    // }
    int a = p.size();
    for(int i = 0;i<a;i++){
        q += p.top();
        p.pop();
    }
    cout << q.length() <<endl;
    for(int i = q.length();i>0;i--){
        if(q[i-1]==q[i])continue;
        cout << q[i-1] << " ";
    }
    
}