poj2503 map做法

You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.
Input
Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output
Output is the message translated to English, one word per line. Foreign 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
Sample Output
cat
eh
loops
Hint
Huge input and output,scanf and printf are recommended.

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<map>
#include<vector>
using namespace std;
map<string,string>mp;
int main()
{
    int l,t;
    string s,s1,s2;
    getline(cin,s);
    l=s.length();
    while(l!=0)
    {
        t=s.find(' ',0);//从零号位查找空格
        s1.assign(s,0,t);//string &assign(const string &s,int start,int n);把字符串s中从start开始的n个字符赋给当前字符串
        s2.assign(s,t+1,l-t-1);
        mp[s2]=s1;
        getline(cin,s);
        l=s.length();
    }
    while(cin>>s)
    {
        if(mp.find(s)!=mp.end())
            cout<<mp[s]<<endl;
        else
            cout<<"eh"<<endl;
    }
    return 0;
}