easy c++ sol || beats 97 runtime ||easy to understand
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> sortJumbled(vector<int>& mapping, vector<int>& nums) {\n        vector<pair<int,int>>mapped;\n        for(auto i:nums){\n            int y=0;\n            int t=i;\n            int mul=1;\n                 if (t == 0) {\n                y = mapping[0];\n            } else {\n                while (t != 0) {\n                    int x = t % 10;\n                    y = y + mapping[x] * mul;\n                    t = t / 10;\n                    mul *= 10;\n                }\n            }\n            mapped.push_back({y,i});\n        }\n        sort(mapped.begin(),mapped.end(),[](auto &a,auto &b){\n            return(a.first<b.first);\n        });\n        vector<int>ans;\n        for(auto i:mapped){\n            ans.push_back(i.second);\n        }\n        return ans;\n    }\n};\n```
['C++']