C++代码
时间: 2023-07-10 12:11:57 浏览: 72
同样的算法,C++ 实现如下:
```cpp
#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int k;
cin >> k;
vector<string> words;
string word;
while (cin >> word && word != "end") {
words.push_back(word);
}
// 统计单词出现的次数
unordered_map<string, int> counts;
for (const auto& word : words) {
++counts[word];
}
// 按照出现次数和字母顺序排序
sort(words.begin(), words.end(), [&](const string& a, const string& b) {
return counts[a] > counts[b] || (counts[a] == counts[b] && a < b);
});
// 输出前 k 个出现次数最多的单词
for (int i = 0; i < k; ++i) {
cout << words[i] << endl;
}
return 0;
}
```