Easy Solution || Map+Priority_Queue(Heap) || C++
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    string largestWordCount(vector<string>& messages, vector<string>& senders) {\n        int n=messages.size();\n        unordered_map<string,int>mp;\n        for(int i=0;i<n;i++){\n            int count=1;\n            for(int j=0;j<messages[i].size();j++){\n                if(messages[i][j]==\' \') count++;\n            }\n            mp[senders[i]]+=count;\n        }\n        priority_queue<pair<int,string>>pq;\n        for(auto it:mp){\n            pq.push({it.second,it.first});\n        }\n        return pq.top().second;\n    }\n};\n```
['Ordered Map', 'Heap (Priority Queue)', 'C++']