⚡ Easy Approach | Hash Map and Priority Queue
cpp\nclass Solution {\n    \npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders) {\n\n        int n = messages.size();\n    
```cpp\nclass Solution {\n    \npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders) {\n\n        int n = messages.size();\n        unordered_map<string, int> mp; //name, cnt\n        priority_queue<pair<int, string>> pq; //cnt, name\n \n        for(int i = 0; i < n; i++) {\n            int cnt = 1;\n            for(auto j : messages[i]) {\n                if(j == \' \')\n                    cnt++;\n            }\n            mp[senders[i]] += cnt;\n            pq.push({mp[senders[i]], senders[i]});\n        }\n        \n        return pq.top().second;\n    }\n};\n```
['C', 'Heap (Priority Queue)']