StringStream || Implementation Based Question || Sorting
```\nstatic bool cmp(pair &a,pair &b){\n        \n        if(a.first != b.first) return a.first > b.first;\n        \n        return a.second > b.second;\n     
```\nstatic bool cmp(pair<int,string> &a,pair<int,string> &b){\n        \n        if(a.first != b.first) return a.first > b.first;\n        \n        return a.second > b.second;\n        \n    }\n    \n    string largestWordCount(vector<string>& M, vector<string>& S) {\n        unordered_map<string,int> um;\n        \n        int n = M.size();\n        \n        for(int i=0;i<n;i++){\n            stringstream ss(M[i]);\n            string word;\n            int cnt = 0;\n            while(ss >> word){\n                cnt++;\n            }\n            um[S[i]]+=cnt;\n        }\n        \n        vector<pair<int,string>> vec;\n        \n        for(auto x : um){\n            vec.push_back({x.second,x.first});\n        }\n        \n        sort(vec.begin(),vec.end(),cmp);\n        \n        return vec[0].second;\n        \n    }
['String', 'Sorting']