Ural1585(细节)

#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <string>
#include <cmath>
#include <map>
#include <queue>
using namespace std;
typedef long long LL;
const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-9;
const double PI = acos(-1.0); //M_PI;
string s;
int max(int a , int b , int c)
{
    int k = a > b ? a : b;
    return k > c ? k : c;
}

int main()
{
    #ifdef DoubleQ
    freopen("in.txt","r",stdin);
    #endif

    int n;
    cin >> n;
    int a = 0 , b = 0 , c = 0;
    getchar();
    for(int i = 0 ; i < n ; i ++)
    {
        getline(cin , s);
        if(s == "Emperor Penguin")
            a ++;
        else if(s == "Little Penguin")
            b ++;
        else if(s == "Macaroni Penguin")
            c ++;
    }
    int res = max(a , b , c);
    if(res == a)
        cout << "Emperor Penguin" << endl;
    else if(res == b)
        cout << "Little Penguin" << endl;
    else if(res == c)
        cout << "Macaroni Penguin" << endl;
}