第十一章关联容器

#include <string>
#include <map>
#include <iostream>
#include <algorithm>

using namespace std;

int main(){
    map<string, int> word_count;
    string tmp;
    while (cin >> tmp){
        for (char &ch : tmp)
            ch = tolower(ch);
        tmp.erase(remove_if(tmp.begin(), tmp.end(), ::ispunct), tmp.end());
        word_count[tmp] += 1;
    }
    for (const auto& elem : word_count)
        std::cout << elem.first << " : " << elem.second << endl;
    return 0;
}