poj2503 在线翻译

// poj2503 【在线翻译】

#include <iostream>
#include <algorithm>
#include <ctime>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <set>
using namespace std;

struct Entry
{
    char a[11];
    char b[11];
}entry[100005];

int cmp(Entry entry1,Entry entry2)
{
    return strcmp(entry1.b,entry2.b) < 0;
}

int main()
{
    int num=0;  //统计了一共输入了几对数；
    char word[11];
    while(1)
    {
        scanf("%s%s",entry[num].a,entry[num].b);
        num++;
        cin.get();
        if(cin.peek() == '\n')  break;
    }
    sort(entry,entry+num,cmp);

    while(scanf("%s",word) != EOF)
    {
        int left = 0, right = num-1;
        int n=0;
        while(left <= right)
        {
            int mid= left+(right-left)/2;
            n = strcmp(entry[mid].b,word);
            if(n > 0)
                right = mid-1;
            else if(n < 0)
                left = mid+1;
            else
            {
                printf("%s\n",entry[mid].a);
                break;
            }
        }
        if(n)   cout << "eh" << endl;
    }
}