#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;

int main(){
    //定义一个空的set
    set<int> s1;

    //使用迭代器
    vector<int> ivec;
    int i;
    for(i=0;i<10;i++)
        ivec.push_back(i);
    set<int> s2(ivec.begin(),ivec.end());

    //s3是s2的副本
    set<int> s3(s2);
    return 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;

int main(){
    //--- 插入
    set<string> set1; //空set
    set1.insert("the");
    set1.insert("name");

    //--- 获取
    //存在
    cout << "set1.find(\"the\"):" << (set1.find("the") != set1.end() )<< endl; 
    //不存在
    cout << "set1.find(\"thee\"):" << (set1.find("thee") != set1.end() )<< endl;

    //存在
    cout<< "set1.count(\"the\"):" << set1.count("the") << endl;
    //不存在
    cout<< "set1.count(\"thee\"):" << set1.count("thee") << endl;
    return 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
using namespace std;

int main(){

    set<string> excluted;
    map<string,int> word_count;
    string rm_word;

    //将排除的word 放入set中
    while(cin >> rm_word){
        if(rm_word == "stop")
            break;
        excluted.insert(rm_word);
    }

    string word;
    while(cin >> word){
        if( !excluted.count(word)){ //不在排除集合内
            ++word_count[word];
        }
    }

    //输出
    map<string,int>::iterator miter = word_count.begin();
    for(;miter != word_count.end();miter++){
        cout << miter->first<<":";
        cout << miter->second<< endl;
    }
    return 0;
}