Raspon

#include <iostream>
#include<algorithm>
#include<deque>

int Raspon(int n)
{
    std::vector<int> v;
    while(n != 0)
    {
        int cifra = n%10;
        n/=10;
        v.push_back(cifra);

    }
    int mini = 9; int maxi = 0;
    for (int i(0); i<v.size(); i++)
    {
        if (v[i] > maxi)
            maxi = v[i];
        if ( v[i] < mini)
            mini = v[i];
    }
    int razlika = maxi - mini;
   return razlika;
}

int main()
{
    std::deque<int> dek {1234,4567,8975,5641,3652,6523,9214,6541,3625,9685};

    std::sort(dek.begin(), dek.end(), [] (int m, int n)
              {
                  if (Raspon(m) == Raspon(n)) return m<n;
                  return(Raspon(m) > Raspon(n));
              });
    for (int i(0); i<dek.size(); i++)
                std::cout<<dek[i]<< " ";
    return 0;

}