Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func main() {
	heights := make([]int, 10)
	for i := 0; i < 10; i++ {
		sc.Scan()
		heights[i], _ = strconv.Atoi(sc.Text())
	}

	sort.Sort(sort.Reverse(sort.IntSlice(heights)))
	for i := 0; i < 3; i++ {
		fmt.Println(heights[i])
	}
}

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;

#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	EACH(x,vec) is >> x;
	return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	REP(i,vec.size()) {
		if (i) os << " ";
		os << vec[i];
	}
	return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
	REP(i,vec.size()) {
		if (i) os << endl;
		os << vec[i];
	}
	return os;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	vector<int> h(10); cin >> h;
	sort(ALL(h), greater<int>());
	REP(i, 3) cout << h[i] << endl;
}

C++: #include<iostream>

int main(){
	int a[10],b,Ichi=0,Ni=0,San=0,n,i;

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

	for(i=0;i<10;i++){
		if(a[i]>Ichi){
			b=Ichi;
			Ichi=a[i];
			a[i]=b;
		}
		if(a[i]>Ni){
			b=Ni;
			Ni=a[i];
			a[i]=b;
		}
		if(a[i]>San){
			b=San;
			San=a[i];
			a[i]=b;
		}
	}

	std::cout<<Ichi<<std::endl<<Ni<<std::endl<<San<<std::endl;


	return 0;
}

C++: #include<bits/stdc++.h>
#define ll long long 
#define ull unsigned long long 
#define ld long double
#define ui unsigned int 
using namespace std;
int main()
{
	int* arr = new int[10];
	for (int i = 0; i < 10; i++) {
		cin >> arr[i];
	}
	sort(arr, arr + 10,greater<int>());
	cout << arr[0] << endl << arr[1] << endl << arr[2] << endl;
}

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

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

    for(int i=0;i<9;i++){
        for(int j=1;j<10;j++){
            if(moun[i]<moun[j]){
               temp = moun[i];
               moun[i] = moun[j];
               moun[j] = temp;
            }
        }
    }

    for(int i=0;i<3;i++){
        cout << moun[i] << endl;
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a[10],min1=-1,min2=-1,min3=-1, i,j,k,l;
	for (i = 1; i <= 10; i++) {
		cin >> a[i];
	}
	for (j = 1; j <= 10; j++) {
		if (a[j] > min1) {
			min1 = a[j];
		}
	}
	for (k = 1; k <= 10; k++) {
		if (a[k] > min2 && a[k]!=min1) {
			min2 = a[k];
		}
	}
	for (l = 1; l <= 10; l++) {
		if (a[l] > min3&&a[l]!=min2&&a[l]!=min1) {
			min3 = a[l];
		}
	}
	cout << min3 << " " << min2 << " " << min1 << " " << endl;
	return 0;
}

C++: /*
 * http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0001
 */
#include <iostream>
#include <vector>
#define COUNT 10

using namespace	std;

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int sum[10];
  int  i;
  for(i = 0; i < 10 ;i++)
  cin >> sum[i];
  sort(sum+1,sum+10);
  for(i = 9 ; i > 6;i--)
    cout << sum[i] << endl;
    return 0;
  }

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

C++: #include<stdio.h>

int main(void){

	int h[10]/*={1819,2003,876,2840,1723,
		           1673,3776,2848,1592,922}*/;
	
	int i,j,t;
	for(i=0;i<10;i++){
		printf("山の高さ(整数）>>%d",i+1);
		scanf("%d",&h[i]);
	}
	for(i=0;i<9;i++)
	{
		for(j=i;j<10;j++)
		{
			if(h[i]<h[j])
			{
			   t=h[i];
			   h[i]=h[j];
			   h[j]=t;
			}
		}
	}
	for(i=0;i<3;i++)
	{
		printf("%d\n",h[i]);
	}


	return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	int i,moun,high[10000],j=0;
	for(i=0;i<10000;i++)
	{
		high[i] = 0;
	}
	for(i=0;i<10;i++)
	{
		cin >> moun;
		high[moun] = 1;
	}
	for(i=9999;i>=0;i--)
	{
		if(high[i] == 1)
		{
			cout << i << endl;
			j++;
		}
		if(j == 3)
		{
			break;
		}
	}
	return 0;
}

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]<<endl<<a[8]<<endl<<a[7]<<endl;
	return 0;
}

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

int main(){
	int a[10],b[3],i;

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

		if(i==0)
			b[0]=a[i];
		if(a[i]>=b[0])
		{
			b[2]=b[1];
			b[1]=b[0];
			b[0]=a[i];

		}

		if(a[i]<b[0] && a[i]>=b[1])
		{
			b[2]=b[1];
			b[1]=a[i];
		}

		if(a[i]<b[0] && a[i]<b[1] && a[i]>=b[2])
		{
			b[2]=a[i];
		}

	}

	for(i=0;i<3;i++)
	{
		cout<<b[i]<<'\n';
	}

    return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
	/* ?????????????±±?????° */
	const int len = 5;
	/* ?????????????±±?????°(???????????????) */
	int out = 3;

	int arr[len];

	for (int i = 0; i < len; i++)
		cin >> arr[i];

	// ??????????????????
	for (int i = 0; i < len; i++)
		for (int j = 0; j < len; j++)
			if (arr[i] < arr[j])
				swap(arr[i], arr[j]);

	cout << endl;

	for (int i = len - 1; len - (1 + out) < i; i--)
		cout << arr[i] << endl;

	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int m[10];
	for(int j=0 ; j<10 ; j++){
		cin >> m[j];
	}

	sort(m,m+10);
	
	for(int i=9 ; i>=7 ; i--){
		cout << m[i] << endl;
	}

	return 0;
}

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

int main(){
	int h[10];
	for (int i = 0; i < 10; i++){
		cin >> h[i];
	}
	int n = 0;
	int a = 0;
	while (n == 0){
		n++;
		for (int i = 0; i < 9; i++){
			
			if (h[i]<h[i + 1]){
				a = h[i];
				h[i] = h[i + 1];
				h[i + 1] = a;
				n = 0;
			}
		}
	}
	for (int i = 0; i < 3; i++){
		cout << h[i]<< '\n';
	}
	return 0;
}

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

int Size = 10;

int main(void) {
    int height[Size] = {0};
    
    for(int i = 0; i < Size; ++i) {
        while(!(0 <= height[i] && height[i] <= 10000)) {
            cout << "No." << i + 1 << " : " << flush;
            cin >> height[i];
        }
    }
    sort(height, height + Size);
    
    cout << height[9] << endl
         << height[8] << endl
         << height[7] << endl;
}

C++: num=[]
for i in 0..9
num[i]=gets.to_i
end
for i in 0..2
ans=0
for j in 0..9
if ans<num[j]
ans=num[j]
set=j
end
end
puts ans
num[set]=0
end

C++: #include <stdio.h>

int main(void)
{
	int m[10];
	int temp;
	int i,j,n;

	n=10;
	for(i=0; i<n; i++){
	scanf("%d",&m[i]);
	if(0>m[i]||m[i]>10000)
	  {
	    printf("error\n");
	      return 1;
	  }
	}

	for(i=0; i<n-1; i++)
	{
		 for(j=i+1; j<n; j++)
		 {
			if(m[j] > m[i])
			{
				temp=m[j];
				m[j]=m[i];
				m[i]=temp;
			}
		}
	}

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

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

using namespace std;

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

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