Go: package main

import "fmt"

func main() {
	var height int
	topHeights := [5]int{}

	for i := 0; i < 10; i++ {
		fmt.Scan(&height)

		for j := 0; j < 3; j++ {
			if topHeights[j] < height {
				topHeights[j+2] = topHeights[j+1]
				topHeights[j+1] = topHeights[j]
				topHeights[j] = height
				break
			}
		}
	}

	for i := 0; i < 3; i++ {
		fmt.Println(topHeights[i])
	}
}

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

int main(){
  int Mt[10];
  int s;
  int i, j;
  for (i = 0; i <= 9; i++){
    cin >> Mt[i];
  }

  for (i = 1; i <= 3; i++){
    for (j = 8; j >= 0; j--){
      if (Mt[j] <= Mt[j + 1]){
        s = Mt[j];
        Mt[j] = Mt[j + 1];
        Mt[j + 1] = s;
      }
    }
  }

  for (i = 0; i <= 2; i++){
    cout << Mt[i] << "\n";
  }
  return (0);
}

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  while (1) {}
}

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

int main(void) 
{
	int n;
	vector<int> h;
	for (int i = 0; i < 10; i++)
	{
		cin >> n;
		h.push_back(n);
	}
	sort(h.begin(), h.end());
	for (int i = 9; i >= 7; i--)
	{
		cout << h.at(i) << endl;
	}

	return 0;
}

C++: #include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>

using namespace std;

int main() {
  vector<int> mountains;
  for (int i = 0; i < 10; i++) {
    int mountain;
    scanf("%d", &mountain);
    mountains.push_back(mountain);
  }
  sort(mountains.begin(), mountains.end(), greater<int>());
  for (int i = 0; i < 3; i++) {
    printf("%d", mountains[0]);
    mountains.erase(mountains.begin());
  }
}

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

int main(){
    std::set<int> s = {1819, 2003, 876, 2840, 1723, 1673, 3776, 2848, 1592, 922};
    auto itr = s.end();
    for(int i = 0; i < 3; ++i) {
        --itr;
        std::cout << *itr << std::endl;
    }
    return 0;
}

C++: #include<stdio.h>
#include<algorithm>
main(){int a[10],i;for(i=0;i<10;)scanf("%d",&a[i++]);std::sort(a,a+10);for(i=0;i<3;)printf("%d\n",a[9-i++]);}

C++: #include<stdio.h>
int main()
{
int ara[11];
int i,j,t;
for(i=0;i<10;i++){
scanf("%d",&ara[i]);
}
for(i=0;i<10;i++){
for(j=i+1;j<10;j++){
  if(ara[i]>ara[j]){
  t=ara[i];
  ara[i]=ara[j];
  ara[j]=t;
    }
  }
 }

 for(i=9;i>6;i--){
 printf("%d\n",ara[i]);
 }
 return 0;

}

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

int main()
{
	int h[10] = {}, n[3] = {};
	for (int i = 0; i < 10; i++) {
		cin >> h[i];
		if (h[i] > h[n[0]]) {
			n[2] = n[1];
			n[1] = n[0];
			n[0] = i;
		}
		else if (h[i] > h[n[1]]) {
			n[2] = n[1];
			n[1] = i;
		}
		else if (h[i] > h[n[2]]) {
			n[2] = i;
		}
	}
	for (int i = 0; i < 3; i++) {
		cout << h[n[i]] << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int b[10];
	for(int i=0;i<10;i++)
		cin>>b[i];
	int t;
	for(i=0;i<3;i++)
	{
		for(int j=0;j+i<9;j++)
			while(b[j]>b[j+1])
			{	t=b[j];b[j]=b[j+1];b[j+1]=t;}
		cout<<b[j]<<endl;
	}
	return 0;
}

C++: #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(void){
	int x;
	vector<int> a;
	for (int i = 0; i < 10; i++){
		scanf("%d", &x);
		a.push_back(x);
	}
	sort(a.begin(), a.end());
	for (int i = 0; i < 3; i++){
		printf("%d\n", a[9 - i]);
	}

	return 0;
}

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 <bits/stdc++.h>
using namespace std;
int main(void){
    std::deque<int> deq;
    int a;
    for (int i=0;i<10;i++) {
        cin >> a;
        deq.emplace_back(a);
    }
    sort(deq.begin(),deq.end());
    cout << deq[deq.size()-1] << endl;
    cout << deq[deq.size()-2] << endl;
    cout << deq[deq.size()-3] << endl;
}

C++: #include<iostream>
using namespace std;
main()
{ int  s=0;
  int x[10]={0,0,0,0,0,0,0,0,0,0};
  int t[3]={0,0,0};
  for(int i=0;i<0;i++){
    cin>>x[i];
  }

  for(int k=0;k<3;k++){
    for(int j=0;j<10;j++){
      if(t[k]<x[j]){
        s=t[k];
        t[k]=x[j];
        x[j]=s;
       }
     }
  }
  for(int e=0;e<3;e++){
    cout<<t[e]<<endl;
  }
return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int a[11],max1,max2,max3;
	for (int i=1; i<11; i++){
		while (true){ 
		cout << "山の高さ" << i << "（整数）" ;			
		cin >> a[i];
		if ((cin.good() == 1) && (a[i] >= 0) && (a[i] <= 10000)) {	break; }}}
	max1 = a[1];
	for (i=2; i<11; i++){
		if (max1 < a[i]){
			swap (max1,a[i]);
		}}
	max2 = a[2];
	for (i=3; i<11; i++){
		if (max2 < a[i]){
			swap (max2,a[i]);
		}}
	max3 = a[3];
	for (i=4; i<11; i++){
		if (max3 < a[i]){
			swap (max3,a[i]);
		}}
		cout << max1 << endl;
		cout << max2 << endl;
		cout << max3 << endl;
		return 0;
	}

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

int main(){
	int i, h, m[3] = {};
	for(i = 0; i < 10; ++i){
		cin >> h;
		if( m[2] >= h )
			continue;
		else if( m[1] >= h )
			m[2] = h;
		else if( m[0] >= h ){
			m[2] = m[1];
			m[1] = h;
		}else{
			m[2] = m[1];
			m[1] = m[0];
			m[0] = h;
		}
	}

	cout << m[0] << "\n" << m[1] << "\n" << m[2] << "\n";
	
	return 0;
}

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

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){

int a[10];
REP(i,10)cin>>a[i];
sort(a,a+10);
REP(i,3)cout<<a[9-i]<<endl;

  return 0;
}

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

int main() {
  int a[10];
  for(int i = 0; i < 10; ++i) {
    cin >> a[i];
  }

  for(int i = 0; i < 10; ++i) {
    for(int j = 9; j > i; --j) {
      if(a[j] < a [j - 1]) {
        int t = a[j];
        a[j] = a[j - 1];
        a[j - 1] = t;
      }
    }
  }

  for(int i = 9; i > 6 ; --i) {
    cout << a[i] << endl;
  }
}

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

using namespace std;

void solve()
{
	vector<int> Vec(10);
	for(int i = 0; i < 10; ++i)
	{
		cin >> Vec[i];
	}
	sort(Vec.begin(), Vec.end());
	for(int i = 9; i > 6; --i)
	{
		cout << Vec[i] << endl;
	}
}

int main()
{
	solve();
	return(0);
}