Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)

	s := make([]int, 10)
	for i := 0; i < 10; i++ {
		s[i], _ = strconv.Atoi(read())
	}
	sort.Sort(sort.Reverse(sort.IntSlice(s)))
	fmt.Println(s[0])
	fmt.Println(s[1])
	fmt.Println(s[2])
}

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

using namespace std;

int main()
{
	deque<int> nums;

	for( int i = 0; i < 10; i++ )
	{
		int in;
		cin >> in;
		nums.push_back( in );
	}
	
	
	sort( nums.begin(), nums.end(), greater<int>() );
	int cnt = 1;

	deque<int>::iterator it = nums.begin();
	while( it != nums.end() )
	{
		cout << *it << endl;
		++it;
		cnt++;
		if( cnt == 4 ) break;
	}

	return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
     
int main(void){
    /* 宣言と初期化 */
    int hai[10];
    int id[2];
    int i;
    int temp2nd;
    int temp3rd;
    int tempmax;
              
for(i=0;i<10;i++)
{
   cin >> hai[i];
}
    /* 代入 */
    temp2nd=hai[0];
    tempmax=hai[0];
    temp3rd=hai[0];
    /* 計算 */
for(int j=9;j>1;j--){
    for(i=0;i<j;i++){
        /* 最大値求める */
        if(hai[j]<hai[i])
       {tempmax=hai[i];
         hai[i]=hai[j];
         hai[j]=tempmax
        }
    }
    }

    /* 表示 */
    printf("%d\n",hai[9]);
    printf("%d\n",hai[8]);
    printf("%d\n",hai[7]);
              
    return 0;
}

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

int main() {
	int h[10],max;
	for (int i = 0; i < 10; i++) {
		cin >> h[i];
	}
	
	for (int j = 0; j < 3; j++) {
		max = 0;
		for (int i = 1; i < 10; i++) {
			if (h[max] < h[i])
				max = i;
		}
		cout << h[max] << "\n";
		h[max] = -1;
	}
	return 0;
}

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

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

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

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

int main() {
	int first, second, third;
	first=0;
	second=0;
	third=0;
	int i;
	for(i=1;i<=10;i++){
		if(height of mountain i > third){
			if(height of mountain i > second){
				if(height of mountain i > first){
					first=i;
				}else{
					second=i;
				}
			}else{
				third=i;
			}
		}
	}
	cout << first << endl;
	cout << second << endl;
	cout << third << endl;
	return 0;
}

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

int main(){
  int m, m1 = 0, m2 = 0, m3 = 0;
  for(int i=0;i<10;i++){
    cin >> m;
    if(m > m1){
      m3 = m2;
      m2 = m1;
      m1 = m;
    }else if(m > m2){
      m3 = m2;
      m2 = m;
    }else if(m > m3){
      m3 = m;
    }
  }
  cout << m1 << endl;
  cout << m2 << endl;
  cout << m3 << endl;
  return 0;
}

C++: #include<iostream>

using namespace std;

int main() {
	int top[5]={0,0,0,0,0};
	int yama;

	cin >> top[0];
	for(int i=0; i<9; i++){
		cin >> yama;
		
		for(int j=0; j<3; j++){
			if(yama >top[j]){
				top[j+2] = top[j+1];
				top[j+1] = top[j];
				top[j] =yama;
				break;
			}
		}
	}
	for(int i=0; i<3; i++)
		cout << top[i] << endl;

	return 0;
}

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

using namespace std;

#define rep(i, n) for (int i = 0; i < int(n); ++i)

int main() {
  int a[10];
  rep (i, 10) cin >> a[i];
  sort(a, a+ 10, greater<int>());
  cout << a[0] << endl;
  cout << a[1] << endl;
  cout << a[2] << endl;
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <set>
using namespace std;

int main()
{
	int a = 0 , s=0, d=0, f=0, g=0, h=0, j=0, k=0, l=0, z=0;
	cin >> a, s, d, f, g, h, j, k, l, z;
	int i[10] = { a, s, d, f, g, h, j, k, l, z };
	sort(i, i + 10);
	cout << i[10] << endl;
	cout << i[9] << endl;
	cout << i[8] << endl;

	
	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
 
int main(){
int rank[3],a[10],i = 0,ii = 0;
rank[0] = 0;
rank[1] = 0;
rank[2] = 0;
while(i <= 9){
	cin >> a[i];
	while(ii <= 2){
		if(rank[ii] == 0){
			rank[ii] = a[i];
		}else{
			if(rank[ii] < a[i]){
				if(ii != 2){
				rank[ii+1] = rank[ii];
				rank[ii] = a[i];
				}
				break;
			}
		}
		ii++;
	}
i++;
ii = 0;

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




}

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

using namespace std;

int main(){
	int a[10],i=0;
	for(;i<10;i++)scanf("%d",&a[i]);
	sort(a,a+10);
	for(i=0;i<3;i++)pritnf("%d\n",a[i]);
	return 0;
}

C++: #include <bits/stdc++.h>
#define LL long long
#define rep(i,n) for (int i=0;i<(n);i++)
//#define rep(i,x,n) for (int i=x;i<(n);i++)
using namespace std;
int main(){
	
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n;
	vector<int> vc;
	while(cin >> n){
		vc.push_back(n);
	}
	sort(vc.begin(), vc.end(), greater<int>());
	rep(i, 3){
		cout << vc[i] << endl;
	}
	return 0;
}

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

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

  int i, input;
  vector<int> heights;
  for (i = 0; i < 10; i++) {
    cin >> input;
    heights.push_back(input);
  }

  sort(heights.rbegin(), heights.rend());
  cout << heights.at(0) << endl;
  cout << heights.at(1) << endl;
  cout << heights.at(2) << endl;

  return 0;
}

C++: #include <stdio.h>
const int N = 15;

int main()
{
	int a[N]={0};
	for(int i = 0; i <= 9; i++)
	{
		scanf("%d", &a[i]);
	}
	for(int i = 0; i <= 9; i++)
	{
		for(int j = i; j <= 9; 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 <stdio.h>

int main(){
  int a[10], max, maxidx;
  for(int i=0; i<=9; i++){
    scanf("%d", &a[i]);
  }
  for(int j=0; j<3; j++){
    max = -1;
    for(int i=0; i<=9; i++){
      if(a[i] > max){
	max = a[i];
	maxidx = i;
      }
    }
    printf("%d\n", max);
    a[maxidx] = -1;
  }
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define MOD 1000000007 //10^9+7
#define INF 1000000000 //10^9

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

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

using namespace std;

int main() {
	int m[10];

	for (int i = 0; i < 10; i++)cin >> m[11];

	sort(m, m + 10);

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

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

using namespace std;

int main(){

  int h[20];
  int n=0;

  while(cin>>h[n]){
    n++;
  }

  sort(h,h+n);

  cout << h[n-1] <<endl<< h[n-2]<< endl <<h[n-3]<<endl;
  
  
  return 0;
}

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

const static int MAX = 10000;

int main() {
int R[MAX]={0};
int i;

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

for (int j=MAX - 1; j>0 ; j--){
int cnt = 0;

if  (cnt <= 3) break;

if (R[j] != 0){
cout << R[i] << endl;
cnt++;
}
return 0;
}



}