Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	mt := make([]int, 10)

	for i := 0; i < 10; i++ {
		fmt.Scan(&mt[i])
	}

	sort.Ints(mt)
	fmt.Printf("%d\n%d\n%d\n", mt[9], mt[8], mt[7])

}

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

int main() {
  
  char a[256];
  int mountain[9] = {};
  int lineCount = 0,n,t,j,temp;
  
  for(n=0;n<10;n++) {
    cin.getline(a,256);
    mountain[n] = stoi(a);
    //cout << mountain[n];
  }

  for(t=0; t<10; t++)
  {
    for(j=t; j< 9; j++)
    {
      if(mountain[t] < mountain[j+1] )
      {
        temp= mountain[t];
        mountain[t]= mountain[j+1];
        mountain[j+1]= temp;
      }
    }
  }
  
  for (int i=0; i<3; i++) {
    cout << mountain[i]<< endl;
  }
  
  return 0;
}

C++: #include<stdio.h>   

void func(float); 

int main(void) 
{
	float tai;
	
	while(scanf("%f",&tai)!=EOF)    { 
        	func(tai);
	}  
   	return 0;
}	 
	void func(float tai) 
	{     
	float lim[10]={48.0,51.0,54.0,57.0,60.0,64.0,69.0,75.0,81.0,91.0};   
  	char kai[11][13]={"light fly","fly","bantam","feather","light","light welter","welter","light","middle","light heavy","heavy"};    
 	int i;
       	
	for(i=0;i<10;i++)    {    
		if(lim[i]>=tai){  
			break;   
	      } 
	}     
	printf("%s\n",kai[i]);
}

C++: // 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif 

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	vector<int> a(10);
	for(int i = 0; i < 10; i++){
		int x;
		cin >> x;
		a.push_back(x);
	}
	sort(a.rbegin(), a.rend());
	for(int i = 0; i < 3; i++)cout << a[i] << '\n';
	return 0;
}
// Write Here

C++: #include <iostream>

int main() {
    int num[10] = {1819
,2003
,876
,2840
,1723
,1673
,3776
,2848
,1592
,922};
    int max1=2;
    int max2=1;
    int max3=0;
    for (int i=0; i<10; i++) {
        if (max3 < num[i]) {
            if (max2 < num[i]) {
                if (max1 < num[i]) {
                    max1 = num[i];
                }
                else {
                    max2 = num[i];
                }
            }
            else {
                max3 = num[i];
            }
        }
    }
    
    std::cout << max1 << std::endl;
    std::cout << max2 << std::endl;
    std::cout << max3 << std::endl;
    return 0;
}

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

int main(){
	vector <int> all;
	int x;
	for( int i=0 ; i<10 ; i++ ){
		cin >> x;
		all.push_back(x);
	}
	sort(all.begin() , all.end());
	int j = 0;
	for( int i=all.size()-1 ; i>=0 && j<3 ; i-- , j++ )
		cout << all[i] << endl;
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int a[10],i;
    cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>a[8]>>a[9];
    for(i=0;i<10;i++){
        cin>>a[i];
    }
    sort(a,a+10);
    cout<<a[9]<<endl;
    cout<<a[8]<<endl;
    cout<<a[7]<<endl;
       return 0;
}

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


int main(){
	vector<int> v;
	for (int i=0;i<10;i++){
		int n;
		cin >> n;
		v.push_back(n);
	}
	sort(v.begin(),v.end(),greater<int>());
	for(int i=0;i<3;i++){
		cout<<v[i]<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

int main(void) {
    std::vector<int> mount(10, 0);
    for (int i = 0; i < 10; i++) {
        std::cin >> mount[i];
    }
    std::sort(mount.begin(), mount.end(), std::greater<int>());
    for (int i = 0; i < 3; i++) {
        std::cout << mount[i] << std::endl;
    }
    return 0;
}

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

int main() {
    vector<int> vec(10);
    for (int i=0;i<10;i++){
        cin>>vec.at(i);
    }
    sort(vec.begin(),vec.end());
    reverse(vec.begin(),vec.end());
    cout<<vec.at(0)<<endl;
    cout<<vec.at(1)<<endl;
    cout<<vec.at(2)<<endl;
}

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

int main(){
int a[10];
int b;
int c;
int d;
int e;
c=0;
d=0;
e=0;
b=0;
while(b<10){
cin >> a[b];
if(c<a[b]){e=d;
           d=c;
           c=a[b];}
else if(d<a[b]){e=d;
                d=a[b];}
else if(e<a[b]){e=a[b];}
b=b+1;
}          
cout << c <<endl;
cout << d <<endl;
cout << e <<endl;
    return 0;
}

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

int main(){
	int mt[10];
	for(int i = 0; i < 10; i++)
		cin >> mt[i];
	for(int i = 0; i < 3; i++){
		for(int j = i + 1; j < 10; j++){
			if(mt[i] < mt[j]){
				int z = mt[i];
				mt[i] = mt[j];
				mt[j] = z;
			}
		}
	}

	cout << mt[0] << endl << mt[1] << endl << mt[2] << endl;
}

C++: #include<iostream>
#include<array>
#include<algorithm>

using namespace std;

int main(){
    array<int, 10> mountain_height;
    for(int i = 0; i < 10; i++){
        cin >> mountain_height[i];
    }
    sort(begin(mountain_height), end(mountain_height));
    for(int i = 0; i < 3; i++){
        cout << mountain_height[9-i] << endl;
    }
    return 0;
}

C++: #include<iostream>
#include <vector>
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define REPI(i,a,b) for(int i=(int)a;i<(int)b;++i)
using namespace std;

void solver() {
    vector<int> m;
    REP(i,10){
        int n;
        cin>>n;
        m.push_back(n);
    }
    sort(m.begin(),m.end(),greater<int>());
    REP(i,3){
        cout<<m[i]<<endl;
    }
}

int main() {
    solver();
}

C++: #include<stdio.h>
int main(void)
{
    int x[10],i,n,y;
	for(i=0;i<10;i++){
	scanf("%d",&x[i]);
	}
	for(i=0;i<9;i++){
	    for(n=i+1;n<10;n++){
			if(x[i]<x[n]){
				y=x[i];
				x[i]=x[n];
				x[n]=y;
			}
		}
	}
	for(i=0;i<3;i++){
	printf("%d\n",x[i]);
	}
	return 0;
}

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

int main(){
  multiset<int> m;
  int a;
  for(int i=0; i<10; i++){
    cin >> a;
    m.insert(a);
  }

  multiset<int>::reverse_iterator it = m.rbegin();
  for(int i=0; i<3; i++)
    cout << *it++ << endl;

  return 0;
}

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

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i <= _##i poi i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i < _##i poi i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i >= _##i poi i--)
#define downtil(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i > _##i poi i--)

#define unless(c) if(!(c))
#define until(c) while(!(c))
#define loop while(true)

#define poi ;
#define poipoi << "\n"

using namespace std;

int main(){
	vector<int> pyon(10) poi
    times(10, i) cin >> pyon[i] poi
    sort(pyon.begin(), pyon.end(), greater<int>()) poi
    times(3, i) cout << pyon[i] poipoi poi
    return 0 poi
}

C++: #include<stdio.h>
const int N = 15;
int main()
{
	int a[N] = {0};
	for(int i = 0; i < 10; i++)
	{
		scanf("%d", &a[i]);
	}
	for(int i = 0; i < 10; i++)
	{
		
		for(int j = i; j < 10; j++)
		{
			if(a[i] < a[j])
			{
				int tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	} 
	for(int i = 0; i < 3; i++)
	{
		printf("%d\n", a[i]);
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int h1=0,h2=0,h3=0,h;
  for(int i;i<10;++i){
    cin >> h;
    if(h>h1){
      h3=h2;
      h2=h1;
      h1=h;
    }else if(h>h2){
      h3=h2;
      h2=h;
    }else if(h>h3){
      h3=h;
    }
  }
  cout<<h1<<endl<<h2<<endl<<h3<<endl;
}

C++: #include<stdio.h>

int main(void)
{
	int high[10]={1819,2003,876,2840,1723,1673,3776,2848,1592,922};
	int x,max,time;


	for(time=1;time<=3;time)
	{
		max=0;

		for(x=0;x<10;x++)
		{
			if(max<high[x])
			{
				max=high[x];
			}
		}
		for(x=0;x<10;x++)
		{
			if(max==high[x])
			{
				printf("%d\n",high[x]);
				high[x]=0;
				time++;
			}
		}
	}

	return 0;
}