/*
TASK: music
LANG: C++
*/
#include <cstdio>
#include <queue>
#define maxN 10005

using namespace std;

typedef struct man {
        char name[12];
        double bal;
        };

priority_queue <pair<double,int>, vector<pair<double,int> >, less <pair<double,int> > > q;

int days,num=1;
man list[maxN];

void solve()
{
     int i,j,n;
     pair<double,int> out;
     scanf("%d",&days);
     for (i=0;i<days;++i){
         scanf("%d",&n);
         for (j=0;j<n;++j) {
             scanf("%s %lf",list[num].name,&list[num].bal);
             q.push(make_pair(list[num].bal,-num));
             ++num;
             }
         scanf("%d",&n);
         for (j=0;j<n;++j) {
             /*out = q.top();
             printf("popvam %s\n",list[-out.second].name);*/
             q.pop();
             }
         }
     out = q.top();
     printf("%s\n",list[-out.second].name);
}

int main()
{
    solve();    
    return 0;
}
