Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"sort"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	mountains := make([]int, 10)
	for i:=0; i<10; i++{
		mountains[i]=nextInt()
	}
	sort.Ints(mountains)
	for _, v := range mountains[7:]{
		fmt.Fprintln(out, v)
	}
}

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

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

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

template <typename T> void b_sort(T* a , int n){
	int i , j;
	for(i=1;i<n;i++){
		for(j=n-i-1;j>=0;j--){
			if(a[j]<a[j+1]){
				a[j]^=a[j+1];
				a[j+1]^=a[j];
				a[j]^=a[j+1];
			}
		}
	}	
} 

int main(){
	unsigned int m[10];
	for(int i=0;i<10;++i){
		cin >> m[i];
	}
	b_sort(m , 10);
	cout << m[0] << "\n" << m[1] << "\n" << m[2] << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
bool cmp(int a, int b){
	return a < b;
}
vector<int> ans;
int main(){
	int h;
	for(int i = 1; i <= 10; i++){
		cin >> h;
		ans.push_back(h);
	}
	sort(ans.begin(), ans.end(), cmp);
	for(int j = 9; j >= 7; j--)
		cout << ans[j] << endl;
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
 
int main(){
    vector<int> h{};
    int in{};
    for(int i=0;i<10;i++){
        cin>>in;
        h.push_back(in);
    }
    sort(h.begin(),h.end());
    cout<<h[9]<<endl;cout<<h[8]<<endl;cout<<h[7]<<endl;
    return 0;
}

C++: #include<stdio.h>

int main(){
	int a1 = 0, a2 = 0, a3 = 0;
	int x;
	for(int i = 0; i < 10; i++){
		scanf("%d", &x);
		if(x > a1){
			a3 = a2;
			a2 = a1;
			a1 = x;
		}else if(x > a2){
			a3 = a2;
			a2 = x;
		}else if(x > a3){
			a3 = x;
		}
	}

	printf("%d\n%d\n%d\n", a1, a2, a3);

	return 0;
}

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

int main()
{
	int data[10];
	for (int i = 0; i < 10; ++i) {
		cin >> data[i];
	}
	int max[3] = { 0 };
	int n = 0, i = 0, temp;
	while (n < 3) {
		if (max[n] < data[i]) {
			max[n] = data[i];
			temp = i;
		}
		++i;
		if (i == 10) {
			data[temp] = 0;
			++n;
			i = 0;
		}
	}

	cout << max[0] << endl << max[1] << endl << max[2] << endl;
	
	return 0;
}

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

int main(){

int i,j,h,temp;
int m[10];



//入力
for(i=0; i<10; i++){
   cout << "height of mountain " << i+1 << "(0 <= height of mountain <= 10000):";
   cin >> h;

   if(h >= 0 and h <= 10000){
       m[i]=h;
   }else{
   cout << "0 <= height of mountain <= 10000を満たしておりません。もう一度入力してください。\n";
   i--;
   }
}



//ソート
    for (i = 0; i < 9; i++) {
        for (j = 9; j > i; j--) {
            if (m[j - 1] > m[j]) {  
                temp = m[j];  
                m[j] = m[j - 1];
                m[j - 1] = temp;
            }
        }
    }
    
    
//出力
cout << "result\n";
for (i = 9; i > 6; i--) {
   cout << m[i] << "\n";
}

    return 0;
}

C++: #include<stdio.h>

int main(void){
  int a,b,c,d,i;  
  a=b=c=d=0;
  for(i=0;i<10;i++){
    scanf("%d",&a);
    if(a>d)//first
      {
     
     
        b=c;
	c=d;      
d=a;}
    else if(a>c)
      {
      b=c;
      c=a;   }
    else if(a>b)
      { b=a;}
      

  }
    
printf("\n\n\n\n%d\n%d\n%d\n",d,c,b); 
 return 0;
}

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

int main(){
	int x[10];
	for (int i = 0; i < 10; i++){
		cin >> x[i];
	}
	sort(begin(x), end(x));
	cout << x[9];
	cout << x[8];
	cout << x[7];
	
}

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

int main() {
    std::array<int, 10> arr;

    for (int i = 0; i < 10; ++i) {
        std::cin >> arr[i];
    }
    
    std::sort(arr.begin(), arr.end(), std::greater<int>());
    
    std::cout << arr[0] << std::endl;
    std::cout << arr[1] << std::endl;
    std::cout << arr[2] << std::endl;

    return 0;
}

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

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

int main(){

int top[3] = {0,0,0};

while(cin.peek() != char_traits<char>::eof()){

int h;
cin >> h;

if(h > top[2]){
top[2] = h;
if(h > top[1]){
top[2] = top[1];
top[1] = h;
if(h > top[0]){
top[1]=top[0];
top[0]=h;
}
}
}

}

cout << top[0] << endl << top[1] << endl << top[2] << endl;
return 0;
}

C++: #include<stdio.h>

int main(){
	
	int a[3]={-1,-1,-1},i,b;
	
	for(i=0;i<10;i++){
		
		scanf("%d",&b);
		
		if(b>=a[0]){
			
			a[2]=a[1];
			a[1]=a[0];
			a[0]=b;
		}
		else if(b>=a[1]){
			
			a[2]=a[1];
			a[1]=b;
		}
		else if(b>=a[2]){
			
			a[2]=b;
		}
		
		printf("%d\n%d\n%d\n\n",a[0],a[1],a[2]);
	}
	printf("%d\n%d\n%d\n",a[0],a[1],a[2]);
	
	return 0;
}

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

int main(){
    vector<int> heights(10);;
    for(int i = 0; i < 10; ++i){
        cin >> heights[i];
    }
    sort(heights.begin(), heights.end(), greater<int>());

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

    return 0;
}

C++: #include<iostream>

int main(){
int a[10];
int max = 0;
int max2 = 0;
int max3 = 0;
int i;
int tmp;

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

for(i = 0; i< 10; i++){
if(max < a[i]){
max = a[i];
tmp = i;
}
}


int tmp2;
for(int i = 0; i< 10; i++){
if(max2 < a[i] && tmp != i){
max2 = a[i];
tmp2 = i;
}
}

for(i = 0; i< 10; i++){
if(max3 < a[i]&& tmp != i&& tmp2 != i) max3 = a[i];
}

std::cout << max<< std::endl;
std::cout << max2<< std::endl;
std::cout << max3<< std::endl;



	return 0;
}

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

int main(void){

  int height[10];
  int i;

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

  sort(height, height+10);

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

  return 0;

}

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


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

    sort(mountain.begin(), mountain.end(), greater<int>());

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

C++: #include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
#define REP(i,n) for(int i = 0; i < n; i++)
using namespace std;

int main() {
  int num;
  vector<int> v;
  REP(i,10)  {
    scanf("%d", &num);
    v.push_back(num);
  }
  sort(v.begin(), v.end(),greater<int>());
  REP(i,3) printf("%d\n", v[i]);
  return 0;
}

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

using namespace std;

int main()
{
    int temp;
    int height[10];
    int n = sizeof(height)/sizeof(height[0]);
    for(int x = 0; x < n; x++){
        cin >> height[x];//input
    }
    cout << endl;
    for(int q = 0; q < n - 1; q++){
        for(int w = 0; w < n - q - 1; w++)
        {
            if(height[w] < height [w+1])
            {
                temp  = height[w];
                height[w] = height[w+1];
                height[w+1] = temp;
            }
        }
    }

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

C++: def main():
    a=[]
    for i in range(10):
        a.append(int(input()))
    a.sort()
    for j in range(-1, -4, -1):
        print(a[j])