Go: package main

import (
    "fmt"
    "sort"
)

type Player struct {
    Name int
    Score  int
}

type Place []Player

func (p Place) Len() int {
    return len(p)
}

func (p Place) Swap(i, j int) {
    p[i], p[j] = p[j], p[i]
}

func (p Place) Less(i, j int) bool {

	if p[i].Score == p[j].Score {
		return p[i].Name < p[j].Name
	} else {
		return p[i].Score > p[j].Score
	}
   
}

func DataEntry(n int) Place {
	var id, sc int
	var ranking Place
	var adding Player

	for i := 0; i < n; i++ {

		fmt.Scan(&id, &sc)

		adding.Name = id
		adding.Score = sc

		ranking = append(ranking, adding)
	}

	return ranking
}

func main() {
	var ranking Place
	var num int

		fmt.Scan(&num)
		ranking = DataEntry(num)
	
	sort.Sort(Place(ranking))
	fmt.Println(ranking[0].Name ,ranking[0].Score)
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#define fi first
#define se second
#define fcout(n) cout<<fixed<<setprecision((n))
#define cinl(str) getline(cin,(str))
using namespace std;
bool value(int y,int x,int R,int C){return 0<=y&&y<R&&0<=x&&x<C;}
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
double pie=acos(-1);
int INF=10000009;
int dx[4] = { 0,-1,0,1 };
int dy[4] = { -1,0,1,0 };


int main() {
	int n,a[25],v[25],b[25];
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i]>>v[i];
		b[i]=v[i];
	}
	sort(b,b+n);
	for(int i=0;i<n;i++){
		if(v[i]==b[n-1]){
			cout<<a[i]<<" "<<v[i]<<endl;
			return 0;
		}
	}
}

C++: #include<iostream>
#include<cstdio>
using namespace std;

int main(){
  int n,m,max=0,num;
  scanf("%d",&n);
  int data[n];
  for(int i=0;i<n;i++){
    scanf(" %d %d",&num,&data[i]);
    if(data[i]>max){
      max=data[i];
    }
  }
  
  for(int i=0;i<n;i++){
    if(max == data[i]){
      printf("%d %d\n",i+1,data[i]);
      break;
    }
  }

  return(0);
}

C++: #include<stdio.h>

int main(){

int x,y,n;
int X=0,Y=0;


scanf("%d",&n);

for(int i=0;i<n;i++)
{
scanf("%d %d",&x,&y);
if(Y<y){X=x;Y=y;}
}

printf("%d %d\n",X,Y);
return 0;
}

C++: #include<stdio.h>
int main(){
	int n,i,a[20]={},v[20]={};
	int tmp;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		
		scanf("%d%d",&a[i],&v[i]);
	}
	int j,h;
	for(j=0;j<n-1;j++){
		for(h=n-1;h>j;h--){
			
			if(v[h]>v[h-1]){
				tmp=v[h];
				v[h]=v[h-1];
				v[h-1]=tmp;
				tmp=a[h];
				a[h]=a[h-1];
				a[h-1]=tmp;
				
			}
		}
		
	}
	int max=v[0];
	for(i=1;i<n;i++){
		if(max==v[i]){
			if(a[0]>a[i]){
				tmp=a[0];
				a[0]=a[i];
				a[i]=tmp;
			}
		}
	}
	
	
	printf("%d %d\n",a[0],v[0]);
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int n;
    cin >> n;
    int max=0; int kouho =0;
    for(int i=0;i<n;i++){
        int a,b;
        cin >> a >> b;
        if(max < b){
            max = b;
            kouho = a;
        }
    }
    cout << a << " " << b << endl;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <algorithm>
#include <string>
#include <sstream>
 
#define INPUT_FROM_FILE (0) 
#if INPUT_FROM_FILE
#include <fstream>
#endif

int main(int argc, char **argv){
	int a, v, n;
	int max_v = -1;
	int max_a = -1;

#if INPUT_FROM_FILE
	std::ifstream ifs("test.txt");
	//FILE *fp = fopen("test.txt", "r");
#endif

#if INPUT_FROM_FILE
	ifs >> n;
#else
	std::cin >> n;
#endif

	for(int i = 0; i < n; i++){
#if INPUT_FROM_FILE
		ifs >> a >> v;
#else
		std::cin >> a >> v;
#endif
		if(max_v < v){
			max_v = v;
			max_a = a;
		}
		else if(max_v == v && max_a > a){
			max_a = a;
		}
	}
 
	std::cout << max_a << " " << max_v << std::endl;

#if INPUT_FROM_FILE
	//fclose(fp);
#endif
    return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;

int main()
{
	int n, a, v,maxa,maxv;
	cin >> n;
	maxa = 0;
	maxv = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> a;
		cin >> v;
		if (maxv < v)
		{
			maxa = a;
			maxv = v;
		}
	}

	cout << maxa << ' ' << maxv << endl;

	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  long long int n,a,b,max = -1,ans;
  cin >> n;
  while(n--){
    cin >> a >> b;
    if(max < b ){
      max = b;
      ans = a;
    }else if(max == b && ans > a ){
      ans = a;
    }
  }
  cout << ans << " " << max << endl; 
}

C++: #include <iostream>
#include <algorithm>
using namespace std;


int main()
{
	int ary[21] = {};
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		int a, b;
		cin >> a >> b;
		ary[a] = b;
	}
	int *p = max_element(ary + 1, ary + n + 1);
	cout << p - ary << ' ' << *p << endl;

	return 0;
}

C++: #include <stdio.h>
int main(){

  int n,num,amo,resnum=0,resamo=0,i;

  scanf("%d",&n);

  for(i = 0; i < n ; i++){

    scanf("%d %d",&num,&amo);

    if(amo > resamo){

      resamo=amo;
      resnum=num;
    } else if(amo == resamo && num < resnum){
      resnum=num;

    }

  }

  printf("%d %d\n",resnum,resamo);

  return 0;

}

C++: #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

int main() {
  int n;
  cin >> n;
  pii ans;
  REP(i,n) {
    int a,b;
    input(a,b);
    chmax(ans, pii(b,-a));
  }
  cout << -ans.second << " " << ans.first << endl;
}