[프로그래머스] 정수 내림차순으로 배치하기

 

• 풀이

#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

long long solution(long long n) {
    long long answer = 0;
    vector<int>arr;
    while(n){
        arr.push_back(n%10);
        n/=10;
    }
    sort(arr.begin(),arr.end());
    for(int i=0; i<arr.size();i++){
        answer = answer + pow(10,i)*arr[i];
    }
    return answer;
}