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>
using namespace std;

int main()
{
    int* h = new int[10];

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

    int tmp;
    for(int j=0; j<9; j++){
        for(int k=0; k<9; k++){
         if(h[k] < h[k+1]){
                tmp = h[k];
                h[k] = h[k+1];
                h[k+1] = tmp;
            }
        }
    }

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

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main(void){
    int h[10],i;

    for(i=0;i<10;i++){
	scanf("%d",&h[i]);
    }
    sort(h,h+10);
    printf("%d\n%d\n%d\n",h[9],h[8],h[7]);
    
    return 0;
}

C++: #include<stdio.h>

int main()
{
	int mth[10];
	int topthree[3] = {0};

	for (int i = 1; i <= 10;){
		scanf("%d", &mth[i - 1]);
		if (0 <= mth[i - 1] && mth[i - 1] <= 10000)
			i++;
	}
	for (int i = 0; i <= 9; i++){
		if (topthree[0] <= mth[i]){
			topthree[2] = topthree[1];
			topthree[1] = topthree[0];
			topthree[0] = mth[i];
		}
		else if (topthree[1] <= mth[i]){
			topthree[2] = topthree[1];
			topthree[1] = mth[i];
		}
		else if (topthree[2] <= mth[i]){
			topthree[2] = mth[i];
		}
	}
	for (int i = 0; i <= 2; i++){
		printf("%d\n", topthree[i]);
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
    int a[10];
    for(int i = 0; i < 10; i++){
        cin >> a[i];
    }
    
    sort(a, a + 10,greater<int>());
    
    cout << a[0] << endl;
    cout << a[1] << endl;
    cout << a[2] << endl;

}

C++: #include<bits/stdc++.h>
using namespace std ;
int main()
{
    int arr[10] ;
    for(int i=0 ; i<10 ; i++)
        cin>>arr[i] ;
    sort(arr,arr+10) ;
    cout<<arr[9] <<endl ;
    cout<<arr[8] <<endl ;
    cout<<arr[7] <<endl ;
    return 0 ;
}

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

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

int compare(const void* a, const void* b){return *((int*)b)-*((int*)a);}

int main(){
	int hight[10];
	for(int i =0;i<=9;i++) cin >> hight[i];
	qsort(hight,10,sizeof(int),compare);
	for(int i = 0;i<=2;i++) cout << hight[i] << endl;
	return 0;
	}

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

int main()
{
    int in;
    vector<int> v;
    while(cin >> in)
    {
        v.push_back(in);
    }
    sort(v.begin(), v.end(), greater<int>());
    for(auto num : v)
        cout << num << endl;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
const int    INF = 100000000;
const double EPS = 1e-10;
const int    MOD = 1000000007;
using namespace std;
typedef pair<int,int> P;

int main(){
	int x[10];
	rep(i,10) cin >> x[i];
	sort(x,x+10,greater<int>());
	rep(i,3) cout << x[i] << endl;
}

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

using namespace std;

int main(void) {
        int i;
        int height_of_mountain[10];

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

        sort(height_of_mountain, height_of_mountain+10);

        cout << height_of_mountain[9] << endl;
        cout << height_of_mountain[8] << endl;
        cout << height_of_mountain[7] << endl;

        return 0;
}

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

C++: 
#include<stdio.h>
void sort(int *a,int n)
{
int k,i,j;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]<a[j])
{
k=a[i];
a[i]=a[j];
a[j]=k;
}
}
}
return ;
}
int main()
{
int a[10];
int i;
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}

sort(a,10);

for(i=0;i<3;i++)
{
printf("%d\n",a[i]);
}
return 0;
}

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

int main()
{
	int highth[10] = { };
	int buf;

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

	for (int i = 0; i < 10; i++){
		for (int j = 0; j < 10; j++){
			if (highth[j] < highth[j + 1]){
				buf = highth[j + 1];
				highth[j + 1] = highth[j];
				highth[j] = buf;
			}
		}
	}

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

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

int main() {
  int a[10];
  for (int i = 0; i < 10; i++) {
    cin >> a[i];
  }
  sort(a, a + 10);
  cout << a[9] << "\n" << a[8] << "\n" << a[7] << "\n";
  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<9;i++)
  for(int j=i+1;i<10;j++)
  if a[i]<a[j]
  {
    int tmp=a[i];
    a[i]=a[j]
    a[j]=tmp;
  }
  cout<<a[1];
  cout<<a[2];
  cout<<a[3];
  return 0;
}

C++: #include <iostream>
#define N 10
using namespace std;
int main()
{
	int p[N];
	for (int i=0;i<N;i++)
		cin>>p[i];
	for (int n=0;n<N-1;n++)
		for (int m=n+1;m<N;m++)
			if (p[n]<p[m])
			{
				int temp=p[n];
				p[n]=p[m];
				p[m]=temp;
			}
			for (int k=0;k<3;k++)
				cout<<p[k]<<endl;
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define range(i,a,n) for(int i=(a);i<(n);i++)

#define LINF    	((ll)1ll<<60)
#define INF     	((int)1<<30)
#define EPS     	(1e-9)
#define MOD     	(1000000007ll)
#define fcout(a)	cout<<setprecision(a)<<fixed
#define fs 			first
#define sc			second
#define PI			(3.1415926535897932384)

int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s; a=0;} return os;}
template<class T> void chmax(T &a, const T &b){if(a<b)a=b;}
template<class T> void chmin(T &a, const T &b){if(a>b)a=b;}
void YN(bool b){cout<<(b?"YES":"NO")<<endl;}
void Yn(bool b){cout<<(b?"Yes":"No")<<endl;}
void yn(bool b){cout<<(b?"yes":"no")<<endl;}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	vl v;
	ll in;
	while(cin>>in){
		v.push_back(in);
	}
	sort(all(v),greater<ll>());
	rep(i,3){
		cout<<v[i]<<endl;
	}

}

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

using namespace std;

int main(void){

  int mountain[10];

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

  sort( mountain , mountain + 10 );

  cout << mountain[9] << endl << mountain[8] << endl <<mountain[7] << endl;

  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
int H[10];
int main() {
	int n;
	vi H(n);
	for (int i = 0; i < 10; i++) {
		cin >> H[i];
	}
	sort(H.rbegin(), H.rend());
	for (int i = 0; i <3 ; i++) {
		cout << H[i] << endl;
	}
}