B

Description

We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.

Input Specification

Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

Output Specification

Output is the message translated to English, one word per line. FatMouse words not in the dictionary should be translated as "eh".

Sample Input

dog ogday
cat atcay
pig igpay
froot ootfray
loops oopslay

atcay
ittenkay
oopslay

Output for Sample Input

cat
eh
loops

题意：

一开始每行输入两个单词中间用一个空格分开，然后空一行 输入单词看能不能在之前的每一行的第二个单词有相同的，有就输出该行第一个单词，没有就输出“”eh“”

分析：

用map第二个字母做关键词，用find进行查找

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    multimap<string,string>v;
    multimap<string,string>::iterator it;
    string s,d;
    char f;
    while(cin>>s&&cin.get(f)&&f==' ')
    {
        cin>>d;
        v.insert(make_pair(d,s));
    }
    it=v.find(s);

    if(it!=v.end())
        cout<<(*it).second<<endl;
    else
        cout<<"eh"<<endl;
    while(cin>>s)
    {
        it=v.find(s);
        if(it!=v.end())
            cout<<(*it).second<<endl;
        else
            cout<<"eh"<<endl;
    }
}

感受：

可以用multiset但是我用的时候超时了，找是否有相同的时候耽误了时间，所以换成了map