提交时间:2026-01-04 15:32:08
运行 ID: 80808
#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; struct Letter { char ch; int count; }; bool compare(const Letter& a, const Letter& b) { if (a.count != b.count) return a.count > b.count; return a.ch < b.ch; } int main() { string text; getline(cin, text); vector<int> freq(26, 0); for (char c : text) { if (isalpha(c)) freq[tolower(c) - 'a']++; } vector<Letter> letters; for (int i = 0; i < 26; ++i) { if (freq[i] > 0) letters.push_back({i + 'A', freq[i]}); } sort(letters.begin(), letters.end(), compare); for (int i = 0; i < 26; ++i) { char ch = i + 'A'; int count = 0; for (const auto& l : letters) { if (l.ch == ch) { count = l.count; break; } } cout << i + 1 << " " << ch << ": " << count << endl; } return 0; }