class Solution {
public:
   
        int digit(int n)
        {
            int mx=0;
            int mn=9;

            while(n>0)
            {
                int d = n % 10;
                mx = max(mx, d);
                mn = min(mn, d);

                n=n/10;
            }
            return mx - mn;
        }

    int maxDigitRange(vector<int> b)
    {
        int best = 0;

        for(int x: b)
        {
            best = max(best , digit(x));
        }

        int a = 0;
        for(int x: b)
        {
            if(digit(x) == best)
            {
                a = a + x;
            }
        }
        return a;
    }
    
};