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.Sort(sort.Reverse(sort.IntSlice(mountains)))
	for _, v := range mountains[:3]{
		fmt.Fprintln(out, v)
	}
}

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

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

C++: #include <stdio.h>
#include <stdlib.h>

#define NUM 10

int comp(const void *, const void *);

int comp(const void *x, const void *y) {

    return *(const int *)x - *(const int *)y;
    
}

int main(int argc, char *argv[]) {

	int i = 0;
    int Mt[NUM] = {0};

	for(i=0; i<NUM; i++) {
		fscanf(stdin, "%d", &Mt[i]);
	}
	
	qsort(Mt, NUM, sizeof(int *), comp);
	
	for(i=NUM; i>7; i--) {
		fprintf(stdout, "%d\n", Mt[i-1]);
	}

    return 0;

}

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



int main() {

//変数の宣言

	int i,j,temp;
	vector<int> hight;


/////メイン処理/////

	for(i=0;i<10;i++){
		cin >> temp;
		hight.push_back(temp);
	}
	
	for(j=0;j<hight.size()-1;j++){
		for(i=0;i<hight.size()-1-j;i++){
			if (hight[i] > hight[i+1]) {
				temp = hight[i];
				hight[i] = hight[i+1];
				hight[i+1] = temp;
			}
		}
	}
	
	for(i=0;i<3;i++){
		cout << hight[hight.size() -i -1] <<endl;
	}
	
	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;

void SimpleSort(int* array,int n){
    int temp = 0;
    int i = 0;
    int j = 0;

    for(int i=0;i<n-1;i++){
        for(int j=i+1;j<n;j++){
            if(array[i]<array[j]){
                temp = array[i];
                array[i]=array[j];
                array[j]=temp;
            }
        }
    }
    return ;
}

int main(){
    int array[10];

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

    SimpleSort(array,10);

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

    return 0;
}

C++: #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <sstream>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
#include <list>
using namespace std;
#define INF 100000000
typedef long long int lli;
typedef pair<int,int> P;
int dp[100][100];

int main (){
	int top[3];
	for(int i=0 ;i<3; ++i){
		top[i]=0;
	}
	for(int i=0; i<10; ++i){
		int tmp;
		cin >> tmp;
		for(int j=0; j<3; ++j){
			if(top[j]<tmp){
				swap(top[j],tmp);
			}
		}
	}
	for(int i=0; i<3; ++i){
		cout << top[i] << "\n";
	}
	return 0;
}

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

int main() {
	int h, s, t, a;
	h = 0;
	s = 0;
	t = 0;
	for (int i = 1; i <= 10; i++) {
		cin >> a;
		if (h < a) {
			swap(a,h);
		}
		if (s < a) {

			swap(s,a);

		}
		if (t < a) {

			swap(t,a);

		}
	}
	cout << h << endl;
	cout << s << endl;
	cout << t << endl;
	return 0;
}

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

int main(){
	int h[10];
	
	for(int i = 0; i < 10; i++){
		cin >> h[i];
	}
	sort(h,h+10,desc);
	
	for(int i = 0; i < 3; i++){
		cout << h[i] << endl;
	}
	
    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;

int main() {
	int a[10];
	rep(i, 10) {
		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 argc, const char * argv[])
{

    int *input = new int[10];
    
    for(int i=0;i<10;i++){
        cin >> input[i];
    }
    
    sort(input, input +10);
    
    for(int i=0;i<3;i++){
        cout << input[9-i] << endl;
    }
    
    return 0;
}

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.begin();
    for(int i = 0; i < 3; ++i) {
        std::cout << *itr << std::endl;
        ++itr;
    }
    return 0;
}

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

int main(){
	int max1=-1,max2=-1,max3=-1;
	for(int i=0;i<10;i++){
		int n;
		cin >> n;
		if (max1<n){
			max3=max2;
			max2=max1;
			max1=n;
		}
		else if (max2<n){
			max3=max2;
			max2=n;
		}
		else if (max3<n){
			max3=n;
	}
	}
	cout << max1 << endl <<max2 <<endl << max3 <<endl; 
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <functional>
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>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<int> yama(10);
    for(int i=0;i<10;i++){
        cin >> yama[i];
    }
    sort(yama.begin(),yama.end());
    cout << yama[9] << "\n" << yama[8] << "\n" << yama[7] << "\n";
}

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

int main() {
	int height[10];
	for (int i = 0; i < 10; i++) {
		cin >> height[i];
	}
	sort(height,height+10);
	for (int i = 9; i > 6; i--) {
		cout << height[i] << endl;
	}
}

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

int main(){
	list<int> height_list(10);

	for(int i=0; i<10; ++i){
		int height;
		cin >> height;
		height_list.push_back(height);
	}

	height_list.sort(greater<int>());
	list<int>::iterator ite = height_list.begin();
	for(int i=0; i<3; ++i){
		cout << *ite++ << endl;
	}
	return 0;

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

int i =0;
int nums[10000]={};

int main(){
while(scanf("%d",nums+i)!=EOF) i++;
sort(nums,nums+i);
for(int j =i-1,c=0;c++<3;j--) printf("%d\n",nums[j]);
    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 <queue>
#include <algorithm>

int main(void) {
    std::priority_queue<int> heights;
 
    for (int h, i = 0; i < 10; ++i) {
        std::cin >> h;
        heights.push(h);
    }
 
    for (int i = 0; i < 3; ++i) {
        std::cout << heights.top() << std::endl;
        heights.pop();
    }

    return 0;
}

C++: #include<iostream>
 using namespace std;
int main(){
int input[10];
int first;
int second;
int third;
for(int i=0,i<10,i++){
cin>>input[i];
if(first<input){first = input[i];}else 
if(second<input){second = input[i];}else 
if(third<input){third = input[i];}
}
cout<<first<<endl;
cout<<second<<endl;
cout<<third<<endl;
return 0;

}

C++: #include<stdio.h>

int main()
{
	int high[10] = {1819,2003,876,2876,1723,1673,3776,2848,1592,922};
	int cases;
	
	for(int i=0;i<9;i++)
	{
		for(int j=i+1; j<10; j++)
		{
			if(high[i] < high[j])
			{
				cases = high[i];
				high[i] = high[j];
				high[j] = cases;
			}
		}
	}
	
	printf("%d",high[0]);
	printf("%d",high[1]);
	printf("%d",high[2]);
	
	return 0;
}

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

int main() {
	int i, j, a[10] = {0}, temp;
	for (i = 0; i < 10; i++) {
		cin >> a[i];
	}
	for (i = 0; i < 10; i++) {
		for(j = 0; j < 10; j++) {
			if (a[j] > a[i]) {
				temp = a[j];
				a[j] = a[i];
				a[i] = a[j];
			}
		}
	}
	for (i = 9; i > 6; i--) {
		cout << a[i] << endl;
	}
	return 0;
}