백준 1427번 C++ 풀이

#include <iostream>
#include <algorithm>
#include <queue>
#include <climits>
using namespace std;

int main(){
    cin.tie(NULL);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;

    priority_queue<int> pq;
    while (n != 0){
        pq.push(n%10);
        n = n/10;
    }
    while (!pq.empty()){
        cout << pq.top();
        pq.pop();
    }
    return 0;
}