不做最后一个！

#include<string>
#include<vector>
#include<algorithm>
using namespace std;
#define x first
#define y second
pair<string,int>a[7] = {{"Bessie",0},{"Elsie",0},{"Daisy",0},{"Gertie",0},{"Annabelle",0},{"Maggie",0},{"Henrietta",0}};
bool cmp(pair<string,int> a, pair<string,int>b)
{
    if(a.y < b. y )return true;
    else return false;
}
int main()
{
    int n;
    int cnt = 0;
    cin >>n;
    for(int i = 0; i < n; i ++)
    {
        string s;
        cin >>s>>cnt;
        for(int k = 0; k < 7; k ++)
        {
            if(a[k].x == s)a[k].y += cnt;
        }
    }
    sort(a, a + 7, cmp);
    int num = a[0].y;
    for(int i = 1; i < 7; i ++)
    {
        if(num < a[i].y  )
        {
            if(a[i + 1].y == a[i].y && i != 6){
            cout <<"Tie"<<endl;
            return 0;
        }
        else {
            cout << a[i].x;
            return 0;
        }
        }
        if(i == 6)
        {
            cout <<"Tie"<< endl;
        }
    }
    return 0;
}