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];
	int j[25]={};
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i]>>v[i];
		b[a[i]-1]=v[i];
	}
	sort(b,b+n);
	for(int i=0;i<n;i++){
		if(v[i]==b[n-1]){
			j[a[i]]++;
		}
	}
	for(int i=1;i<=n;i++){
		if(j[i]!=0){
			cout<<i<<" "<<b[n-1]<<endl;
			return 0;
		}
	}
}

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

int main() {
  int n, a, v, ma, mv = 0;
  cin >> n;
  for(int i = 0; i < n; i++) {
    cin >> a >> v;
    if(v > mv) {
      ma = a;
      mv = v;
    }
  }
  cout << ma << ' ' << mv << endl;
}

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(-1,0);
  REP(i,n) {
    int a,b;
    cin >> a >> b;
    chmax(ans, pii(b,-a));
  }
  printf("%d %d\n", -ans.second, ans.first);
}

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

int main(){
    int n;
    cin >> n;
    pair <int,int> data[20];
    for(int i=0;i<n;i++) {
        cin >> data[i].second >> data[i].first;
        data[i].second *= -1;
    }
    sort(data,data + n);
    cout << -data[n-1].second << " " <<  data[n-1].first << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,a) for(int i = 0; i < (a); i++)
#define reps(i, a, b) for(int i = (a); i < (b); i++)
#define INF 1e9
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int, int> pii;
int main() {
	int n;
	vector<pii> v;
	cin >> n;
	rep(i, n) {
		int ind, a;
		cin >> ind >> a;
		v.push_back(make_pair(a,ind));
	}
	sort(v.begin(), v.end(), greater<pii>());
	cout << v[0].second << " " << v[0].first << endl;
	return 0;
}

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

int main() {
	int n;
	int s[25] = {};
	int sa[25] = {};
	cin >> n;
	for (int i = 0;i < n;i++) {
		int a, v;
		cin >> a >> v;
		s[a - 1] += v;
		sa[a - 1] = s[a - 1];
	}
	sort(sa, sa + 25);

	for (int i = 0;i < 25;i++) {
		if (sa[24] == s[i]) {
			cout << i + 1 << endl;
			break;
		}
	}
	return 0;

}

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

int main(){

  int n;
  int ma,mv;
  int a,v;

  scanf("%d",&n);
  ma=mv=0;

  for(int i=0;i<n;i++){
    scanf("%d %d",&a,&v);
    if(v>mv){
      ma=a;
      mv=v;
    }
    else if(v==mv && a<ma){
      ma=a;
      mv=v;
    }
  }

  printf("%d %d\n",ma,mv);

  return 0;
}

C++: #include <cstdio>
#include <utility>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
	int n;
	scanf("%d", &n);
	vector<pair<int,int> > v(n);
	for(int i = 0; i < n; ++i){
		scanf("%d%d", &v[i].second, &v[i].first);
	}

	const pair<int,int> &p = *max_element(v.begin(), v.end());
	printf("%d %d\n", p.second, p.first);
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int>PA;
using namespace std;
#define MAX 1000
int main(){
    int n; cin>>n;
    PA hoge; hoge.second=-INF;
    int a,b;
    rep(i,n){cin>>a>>b;if(b>hoge.second){hoge.second=b;hoge.first=a;}};
    cout<<hoge.first<<" "<<hoge.second<<endl;
}

C++: //
//  main.cpp
//  ggggggggggggggggggggggggggggggggggggg
//
//  Created by h3037175 on 2017/08/01.
//  Copyright ?? 2017??´ h3037175. All rights reserved.
//

#include <iostream>
using namespace std;
int main() {
    int n,a,v,max=-100000,num;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a>>v;
        if(max<v){
            max=v;
            num=a;
        }
    }
    cout<<num<<" "<<max<<endl;
    return 0;
}

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

struct person {
	int a;
	int v;
};
int main() {
	struct person man[25],max;
	max.a=max.v=0;
	int n;
	cin>>n;
	n--;
	while(n--){
		cin>>man[n].a>>man[n].v;
		if(max.v<man[n].v)max=man[n];
	}
	cout<<max.a<<" "<<max.v<<endl;
	
	return 0;
}