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++: //Name: Calculation of Area
//Level: 1
//Category: やるだけ
//Note:

#include <iostream>

using namespace std;

bool solve() {
    int a, b;
    cin >> a >> b;
    cout << a*b/3.305785 << endl;
    return false;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout.setf(ios::fixed);
    cout.precision(10);

    while(solve()) ;
    return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int n;
	int a[20];
	int v[20];
	int b;
	int i;
	int max;
	
	scanf("%d", &n);
	
	max = 0;
	for (i = 0; i < n; i++){
		scanf("%d %d", &a[i], &v[i]);
		if (max < v[i]){
			max = v[i];
			b = a[i];
		}
	}
	
	for (i = 0; i < n; i++){
		if (max == v[i]){
			printf("%d %d\n", b, v[i]);
			break;
		}
	}
	
	return(0);
}

C++: #include <iostream>

using namespace std;

int p[1000];
int fish[1000];

void buble_sort(int n){

  for( int i = 0 ; i < n - 1 ; i++ ){
    for( int j = n - 1 ; j > i ; j-- ){
      if( fish[j-1] > fish[j] ){

	int temp1 = fish[j];
	fish[j] = fish[j-1];
	fish[j-1] = temp1;

	int temp2 = p[i];
	p[j] = p[j-1];
	p[j-1] = temp2;

      }
    }
  }


}

int main(void){

  int n;

  cin >> n;
  for( int i = 0 ; i < n ; i++ ){
    cin >> p[i] >> fish[i];
  }

  buble_sort(n);

  cout << p[n-1] << " " << fish[n-1] << endl;
  return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int n,a[21],b[101],i,z,zz,max;
	max=-1;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d %d",&a[n],&b[n]);
		if(b[n]>max){
			max=b[n];
			z=a[n];
		}
		if(max==b[n]){
			if(z<a[n]){
			z=z;
			}
			else if(z>a[n]){
			z=a[n];
			}
		}
	}
	printf("%d %d\n",z,max);
	return 0;
}

C++: #include <bits/stdc++.h>

#define loop(v, f, l) for(int v = (f), v##_ = (l); v < v##_; ++v)

using namespace std;

typedef long long int lint;
static inline int in(){ int x; scanf("%d", &x); return (x); }
static inline lint inl(){ lint x; scanf("%lld", &x); return (x); }

int main()
{
	int maxF = 0, winNum = 0;
	int n;
	int get, num;
	scanf("%d", &n);
	loop(i, 0, n)
	{
		scanf("%d%d", &num, &get);
		if( maxF < get )
		{
			winNum = num;
			maxF = get;
		}
		if( maxF == get && winNum > num )
		{
			winNum = num;
		}
	}
	printf("%d %d\n", winNum, maxF);
	return (0);
}

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;
        }
    }
    cout<<ans<<" "<<ma<<endl;
return 0;
}

C++: #include<iostream>
main(int a,v,A,V){for(std::cin>>A;std::cin>>a>>v;)V^v?V<v&&(V=v)&(A=a):A>a&&(A=a);std::cout<<A<<" "<<V<<"\n";}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define CLR(a) memset((a), 0 ,sizeof(a))

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, -1, 1};

int main() {
  int n;
  map<int, int> p;

  cin >> n;
  REP(i, n) {
    int x, y;
    cin >> x >> y;
    p.insert(MP(x, y));
  }
  int max = 0;
  map<int, int>::iterator ans;
  map<int, int>::iterator it = p.begin();
  while(it != p.end()) {
    if(max < it->second) {
      ans = it;
      max = it->second;  
    }
    it++;
  }
  cout << ans->first << ' ' << ans->second << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;

struct Human {
    int no;
    int point;
};

int compareTo(const Human& h1, const Human& h2) {
    if(h1.point > h2.point) return(1);
    else if(h2.point > h1.point) return(0);
    
    if(h1.no < h2.no) return(1);
    else  return(0);
}

int main(void) {
    int n; scanf("%d", &n);
    Human player[n];
    for(int r = 0; r < n; r++) {
        scanf("%d %d", &player[r].no, &player[r].point);
    }
    sort(player, player+n, compareTo);
    printf("%d %d\n", player[0].no, player[0].point);
    return(0);
}

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

int main() {
	int n;
	cin >> n;
	int num = 0;
	int fish = -1;
	for (int i = 0; i < n; ++i) {
		int a, v;
		cin >> a >> v;
		if (fish < v) {
			num = a;
			fish = v;
		}
		else if (fish == v && num > a) {
			num = a;
		}
	}
	cout << num << ' ' << fish << endl;
	
	return 0;
}

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

int main(){
	int n,max=0,num;
	int a[20],v[20];
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i]>>v[i];
	}
	for(int i=0;i<n;i++){
		if(max<v[i]){
			if(max!=v[i]){
				num=i+1;//??????????????¬????????§??????
			}
			max=v[i];
		}
	}
	cout<<num<<" "<<max<<endl;

		return 0;
}

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

using namespace std;

int main(void){

	int n;
	pair<int,int> inp;
	pair<int,int> max;

	cin>>n;

	cin>>max.first>>max.second;
	for(int i=1;i<n;i++){
		cin>>inp.first>>inp.second;
		if(inp.second>max.second) max=inp;
	}

	cout<<max.first<<" "<<max.second<<endl;

	return 0;
}

C++: #include<iostream>
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 "bits/stdc++.h"
using namespace std;
int a,b,c;
int n;
int main(){
cin>>n;
pair<int,int> p[n];
for (int i = 0; i < n; ++i) {
	cin>>a>>b;
	p[i].second=a;p[i].first=-b;
}
sort(p,p+n);
cout<<p[0].second<<" "<<-p[0].first<<endl;
//cout<<p[n-1].second<<" "<<-p[n-1].first<<endl;

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

int main()
{
  int n,a,v,maxa=-1,maxv=-1;

  cin>>n;
  for(int i=0;i<n;i++){
    cin>>a>>v;
    if(maxv<v){
      maxa=a;
      maxv=v;
    }
    else if(maxv==v && a<maxa){
      maxa=a;
      maxv=v;
    }
  }
  cout<<maxa<<" "<<maxv<<endl;
  return 0;
}