ACM ICPC 2017 Warmup Contest 6（ACM Google Cup 2011 Invitational Programming Contest）

最后一场了，最近确实有点累了，只做了一题，做完明天一场pk赛，然后估计就要赶紧补作业了，合理安排时间啊，加油

 G. Google is Feeling Lucky

思路：又是个简单的字符串读取处理和排序，注意一下，取最大值就好了

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <cmath>
#include <string>
#include <queue>
#include <stack>

using namespace std;

const int maxn = 1e5+10;

map<string,int> website;
vector<string> chosen;

int main()
{
    int tt;
    while(cin >> tt)
    {
        for(int t=1;t<=tt;t++)
        {
            website.clear();
            chosen.clear();
            int maxre = 0;
            for(int i=0;i<10;i++)
            {
                string web;
                int relevance;
                cin >> web >> relevance;
                if(website[web]<relevance)
                {
                    website[web] = relevance;
                    if(relevance== maxre)
                    {
                        chosen.push_back(web);
                    }
                    else if(relevance>maxre)
                    {
                        maxre = relevance;
                        chosen.clear();
                        chosen.push_back(web);
                    }
                }
            }
            cout << "Case #" << t << ":" << endl;
            int len = chosen.size();
            for(int i=0;i<len;i++)
            {
                cout << chosen[i] << endl;
            }
        }
    }
    return 0;
}

文章地址： http://blog.csdn.net/owen_q/article/details/78178503