C++||100% Faster||using multimap||with explanation
\n\nmultimap has a property that it store key in sorted ordered and but for same key and different value it don\'t change given ordered. \ntime complexity of in
![image](https://assets.leetcode.com/users/images/e752a492-2108-42db-8a41-ae8981b937d7_1646545072.4505782.jpeg)\n\nmultimap has a property that it store key in sorted ordered and but for same key and different value it don\'t change given ordered. \ntime complexity of insertion,search deletion is log(n) \nfor example\ninput-\n{(7, 40), (2, 30), (7, 50), (3, 60), (7,30), (6, 50), (6, 10)}\noutput\n{(2, 30), (3, 60), (6, 50) , (6, 10), (7, 40), (7, 50), (7,30)}\n\n```\nclass Solution {\npublic:\n    #include<map>    \n    int getvalue(int n,vector<int>& mapping){\n        int value=0,t=1;\n        if(n==0)\n            return mapping[0];\n        while(n!=0){\n            int temp=n%10;            \n            value=mapping[temp]*t+value;\n            t=t*10, n=n/10;\n        }\n        return value;\n    }            \n    vector<int> sortJumbled(vector<int>& mapping, vector<int>& nums) {        \n        multimap<int,int> m;\n        for(int a:nums){            \n            int temp=getvalue(a,mapping);                        \n            m.insert(make_pair(temp,a));\n        }        \n        nums.clear();\n        for(auto itr=m.begin();itr!=m.end();itr++){\n            nums.push_back(itr->second);\n        }\n        return nums;\n    }\n};\n```
['C']