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<stdio.h>
 
int main(){
	int n, a, b, i, max = 0, num = 100;
	scanf("%d", &n);
	for(i = 0; i < n; i++){
		scanf("%d %d", &a, &b);
		if(max <= b){
			max = b;
			if(max < b || num > a){
				num = a;
			}
		}
	}
	printf("%d %d", num, max);
	return 0;
}

C++: //24
#include<iostream>

using namespace std;

int main(){
  int n;
  cin>>n;
  int x,m=-1;
  while(n--){
    int a,v;
    cin>>a>>v;
    if(v>m){
      m=v;
      x=a;
    }
  }
  cout<<x<<' '<<m<<endl;
  return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int n, a, v, a_res=21, v_res=0;
    while(cin>>n) {
        while(n--) {
            cin >> a >> v;
            if ((v_res == v && a_res > a) || (v_res < v)) {
                a_res = a;
                v_res = v;
            } 
        }
        cout << a_res << " " << v_res << endl;
    }
    return 0;
}

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

int main()
{
  int a[21], b[21];
  int n;
  int max = 0;
  int mx;
  cin >> n;
  for (int i = 1; i <= n; i++){
    cin >> a[i] >> b[i];
    if (b[i] >= max){
      max = b[i];
    }
  }
  
  for (int i = 1; i <= 6; i++){
    if (b[i] == max){
      cout << i << " " << max << endl;
      break;
    }
  }


  return 0;

}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  int n,m=0,a,b=100,d;
  cin>>n;
  while(n--){
    cin>>d>>a;
    if(m<a)b=d;
    m=max(m,a);
  }
  cout<<b<<' '<<m<<endl;
}

C++: #include<iostream>
using namespace std;
int main(){
  int n,m=1;cin >> n;
  int d[21]={};
  int a,v;
  while(n--){
    cin >> a >> v;d[a]=v;
    if(d[m]==d[a]&&a<m)m=a;
    if(d[m]<d[a])m=a;
  }
  cout << m << " " << d[m] << endl;
}

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

int main() {
	int n;
	cin >> n;

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

	cout << maxa << " " << maxv << endl;
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
typedef pair<int,pair<int,int> > P;
int main(void){
  pair<int,pair<int,int> > p;
  vector<P> v;
  int n,a,b;
  cin >> n;
  for(int i = 0;i < n; i++){
    cin >> p.second.second >> p.first;
    p.second.first = 100 - p.second.second;
    v.push_back(p);
  }
  sort(v.begin(),v.end());
  cout << v[v.size()-1].second.second << " " << v[v.size()-1].first << endl;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
   
using namespace std;
   
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))
#define ten(n) ((long long)(1e##n))
#define bin(n) (1LL << (n))
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define revrep(i, n) for (int i = (n); i >= 0; --i)
#define pb push_back

template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
template <class T> void chmin(T& a, const T& b) { a = min(a, b); }

template <class T> void uniq(T& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }

template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) cout << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os; }

template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {    if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

void fix_pre(int n) { cout.setf(ios::fixed, ios::floatfield); cout.precision(10); }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
#define trace(x) (cout << #x << ": " << (x) << endl)
 
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }

typedef long long ll;
typedef pair<int, int> pint;

// y(v): v>^<  y(^): ^>v<
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };

const double PI = acos(-1.0);
#define mp make_pair



int main()
{
    int n;
    cin >> n;
    pint res(-1, 0);
    rep(i, n)
    {
        int a, v;
        cin >> a >> v;
        chmax(res, pint(v, -a));
    }
    printf("%d %d\n", -res.second, res.first);
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int a,b,ma,ans,n;
int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a>>b;
        if(ma<=b){
            ans=a;
            ma=b;
        }if(ma==b&&ans>a)ans=a;
    }
    cout<<ans<<" "<<ma<<endl;
return 0;
}