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>
#include <string.h>
 
int Nmem,act;
int cou=1;
int memo[1000001];
int num,fish;
int maxmemo[2]={0};
int scanset[100001];
 
int maxset(int num,int n)
{
    maxmemo[0]=num;
    maxmemo[1]=memo[num];
    return 0;
}
 
int main()
{
    maxmemo[0]=1000001;
    for(int i=0;i<1000001;i++)
    {
        memo[i]=-1;
    }
    scanf("%d%d",&Nmem,&act);
    for(int i=0;i<act;i++)
    {
        scanf("%d%d",&num,&fish);
        if(memo[num]==-1)
        {
            scanset[cou]=num;
            cou++;
            memo[num]++;
        }
        memo[num]=memo[num]+fish;
        if(fish>0)
        {
            if(maxmemo[1]<=memo[num])
            {
                if(memo[num]==maxmemo[1]&&num>maxmemo[0]){}
                else maxset(num,0);
            }
            printf("%d %d\n",maxmemo[0],maxmemo[1]);
        }
        else if(fish<0)
        {
            for(int i=0;i<2;i++)
            {
                maxmemo[0]=1000001;
                maxmemo[1]=0;
            }
            for(int i=0;i<cou;i++)
            {
                if(memo[scanset[i]]>=maxmemo[1])
                {
                    if(memo[scanset[i]]==maxmemo[1]&&scanset[i]>maxmemo[0]){}
                    else maxset(scanset[i],0);
                }
            }
            printf("%d %d\n",maxmemo[0],maxmemo[1]);
        }
    }
    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;
    cin >> a >> b;
    chmax(ans, pii(b,-a));
  }
  printf("%d %d\n", -ans.second, ans.first);
}

C++: #include <iostream>
#include <cstdio>

#define reep(i,n,m) for(int i=(n);i<(m);i++)
#define rep(i,n) reep(i,0,n)

using namespace std;

pair<int, int> pii;

int main(){
    int n;
    cin >> n;
    int s[21] = {0};
    int ans=0;
    int sum=0;
    rep(i,n){
        int a,v;
        cin >> a >> v;
        s[a] += v;
        if(sum<s[a]){
            ans = a;
            sum = s[a];
        }else if(sum==s[a] && ans > a){
            ans = a;
        }
    }

    printf("%d %d\n",ans, sum);
    return 0;
}

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

bool great(const pair<int, int>& l, const pair<int, int>& r) {
	if (l.second == r.second) return l.first < r.first;
	else return l.second > r.second;
}

int main(){
	int n,a,b;
	vector<pair<int, int> > v;
	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> a >> b;
		v.push_back(make_pair(a,b));
	}
	sort(v.begin(), v.end(), great);
	cout << v[0].first << " " << v[0].second << endl;
	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, A, V;
	cin >> n;
	for(int i = 0; i < n; i++){
		int a, v;
		cin >> a >> v;
		if( i == 0 ){
			A = a; V = v;
		}else{
			if( V < v || ( V == v && a < A) ){
				V = v; A = a;
			}
		}
	}
	cout << A << " " << V << endl;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void){

    int n;
    cin>>n;
    int a[30]={0};
    for(int i=1;i<=n;i++){
        int x,y;
        cin>>x>>y;
        a[x] = y;
    }
    int m=0,M=1;
    for(int i=1;i<=n;i++){
        if(m < a[i]){
            M = i;
            m = a[i];
        }



    }
    cout<<M<<" "<<m<<endl;


    return 0;
}

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

struct node {
    int id;
    int score;
    node(int i, int s) : id(i), score(s) { }
    bool operator <(const node &x) const {
        if(this->score != x.score) return this->score > x.score;
        return this->id < x.id;
    }
};

int main() {
    int n; cin >> n;
    vector<node> v;
    while(n--) {
        int id, score; cin >> id >> score;
        v.push_back(node(id, score));
    }
    node p = *min_element(v.begin(), v.end());
    cout << p.id << ' ' << p.score << endl;
}

C++: #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    cin >> n;
    pair<int, int> ans{INF<int>, INF<int>};
    for (int i = 0; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        ans = min(ans, {-b, a});
    }
    printf("%d %d\n", ans.second, -ans.first);
    return 0;
}