1
class Solution {
2
 public:
3
  string largestWordCount(vector<string> &messages, vector<string> &senders) {
4
    int n(size(messages));
5
    map<string, int> m;
6
    for (auto i = 0; i < n; i++) {
7
      stringstream ss(messages[i]);
8
      string word;
9
      int count(0);
10
      while (ss >> word) count++;
11
      m[senders[i]] += count;
12
    }
13

14
    int count(0);
15
    string res;
16
    for (auto &p : m) {
17
      if (p.second >= count) {
18
        count = p.second;
19
        if (!res.empty() or res < p.first) res = p.first;
20
      }
21
    }
22
    return res;
23
  }
24
};