Răspuns:
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,r,nr,i,m;
cin>>n;
m=0;
int v[20];
nr=0;
while(n!=0)
{
r=n%10;
nr++;
v[nr]=r;
n=n/10;
}
sort(v+1, v+nr+1, greater<int>());
for(i=1;i<=nr;i++)
m=m*10+v[i];
cout<<m;
return 0;
}
Explicație: