第一份，求赞

链接描述#include <iostream>
#include <map>
#include <string>
#include <algorithm>
using namespace std;

int main() {
int n;
cin >> n;

map<string, int> freq;
string word;

for (int i = 0; i < n; i++) {
    cin >> word;
    // 转换为小写
    transform(word.begin(), word.end(), word.begin(), ::tolower);
    freq[word]++;
}

string maxWord;
int maxCount = 0;

// 遍历map，找出出现次数最多的单词
for (auto &entry : freq) {
    if (entry.second > maxCount) {
        maxCount = entry.second;
        maxWord = entry.first;
    }
}

cout << maxWord << endl;
return 0;

}