Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	counter := 0
	var mountain []int
	for scanner.Scan() {
		i, err := strconv.Atoi(scanner.Text())
		if err != nil {
			break
		}
		mountain = append(mountain, i)
		counter++
		if counter == 10 {
			break
		}

	}
	sort.Ints(mountain)
	fmt.Println(mountain[9])
	fmt.Println(mountain[8])
	fmt.Println(mountain[7])
}

C++: #include <bits/stdc++.h>
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;
	cout<<a[8]<<endl;
	cout<<a[7]<<endl;
	// your code goes here
	return 0;
}

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

int main(){
  vector<int> n;
  int temp;
  while (cin >> temp) {
    n.push_back(temp);
  }
  sort(n.begin(), n.end(), greater<int>());
  for (int i = 0; i < 3; i++) {
    printf("%d\n", n[i]);
  }
  return 0;
}

C++: #include<iostream>
#include<string>
#include<cmath>
#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;
  cout<<a[8]<<endl;
  cout<<a[7]<<endl;
  return 0;
}

C++: #include <iostream>
#include<algorithm>
using namespace std;
int main() {
	int a,one=0,two=0,three=0;
	for(int i=0;i<10;i++){
		cin>>a;
		if(a>three)three=a;
		if(three>two)swap(three,two);
		if(two>one)swap(one,two);
	}
	cout<<one<<endl<<two<<endl<<three;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int max = 0;
	int b;
	int a[10];
	for(int i = 0;i<=9;i++)
	{
		cin >> a[i];
	}
	for(int k = 1;k<=3;k++)
	{
	  for(int j = 0;j<=9;j++)
	  {
		if(a[j]>max)
		{
			max=a[j];
			b=j;
		}

	  }
	  cout << max << endl;
	  a[b] = 0;
	  max = 0;
	}
	return 0;
}

C++: //----------------------------------------------------
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define vmax_v(ary) *max_element(all(ary))
#define vmin_v(ary) *min_element(all(ary))
#define vmax_id(ary) distance((ary).begin(),max_element(all(ary)))
#define vmin_id(ary) distance((ary).begin(),min_element(all(ary)))

using ll = int64_t;
using pll = pair<ll,ll>;
using vl = vector<ll>;

const ll INF=INT64_MAX;
const double EPS=1e-10;
const double PI=acos(-1.0);

void init(){cin.tie(0);ios::sync_with_stdio(false);}
//----------------------------------------------------

int main(){
  init();
  vl h(10);

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

  sort(all(h),[](const ll &x,const ll &y){return x>y;});

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

  return 0;
}

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

using namespace::std;

int main() {
    int array[10];

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

    sort(array,array+10);

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

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

using namespace std;

int main(){

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

	for(int i=0;i<10;i++){
		higher.push_back(high[i]);
	}

	sort(higher.begin(),higher.end());

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

C++: #include<iostream>
#include<sstream>
#include<cstdio>
#include<fstream>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<cmath>
using namespace std;

int main(){
	vector<int> args;
	for(int x=0;x<10;x++){
		int j;scanf("%d",&j);args.push_back(j);
	}
	sort(args.begin(),args.end());
	for(int x=0;x<3;x++){
		printf("%d\n",args[args.size()-1-x]);
	}
	return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <functional>
#include <cstring>
#include <queue>
#include <math.h>
#include <iterator>
using namespace std;

int main() {
	short mountain[10] = {0};
	for (short i = 0;i < 10;++i) {
		scanf("%d", &mountain[i]);
	}
	sort(mountain, mountain + 10,greater<short>());
	for (short i = 0;i < 3;++i) {
		printf("%d\n", mountain[i]);
	}
}

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


int main()
{
	using namespace std;

	deque<int> nums;
        int tmp = 0;
	for (int i=0; i<10; ++i){
             cin >> tmp;
             nums.push_back(tmp);
        }

	// ソート実行
	sort( nums.begin(), nums.end(), greater<int>() );

	// 結果を出力
	deque<int>::iterator it = nums.begin();
        int n=0;
	while(( it != nums.end() ) && (n<3))
	{
		cout << *it << endl;
		++it;
                ++n;
	}

	return 0;
}

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

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

	int a[10];
	for (int i = 0; i < 10; i++) {
		cin >> a[i];
	}
	sort(a, a + 10);
	reverse(a, a + 10);
	for (int i = 0; i < 3; i++) {
		cout << a[i] << endl;
	}
}

C++: #include<iostream>
using namespace std;
void sort(int[]);
int main()
{
	int list[10];
	for(int i=0;i<10;i++)
		cin>>list[i];
	sort(list);
	cout<<list[9]<<endl<<list[8]<<endl<<list[7]<<endl;
	return 0;
}
void sort(int list[10])
{
	for(int i=0;i<10;i++)
	{
		for(int j=0;j<9;j++)
			if(list[j+1]<list[j])
			{
				int temp=list[j];
				list[j]=list[j+1];
				list[j+1]=temp;
			}
	}
}

C++: #include <iostream>
using namespace std;
int main() {
	const int p = 10;
	int mountain[p];
	for (int i = 0; i < p; i++) { cin >> mountain[i]; }

	for (int t = 0; t < p - 1; t++) {
		for (int s = t + 1; s < p; s++) {
			if (mountain[s] > mountain[t]) {
			//?????????
				int osu = mountain[t];
				mountain[t] = mountain[s];
				mountain[s] = osu;
			}
		}
	}
	for (int k = 0; k < 3; k++) { cout << mountain[k] << endl; }
}

C++: #include <iostream>
int main(){
	int a,b,c;
		for(a=1;a<10;++a){
			for(b=1;b<10;++b){
				c=a*b;
				std::cout<<a<<"x"<<b<<"="<<c<<std::endl;
				}
		}
	 return 0;
	}

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

int main(){
	int example=0;
	int top3[3]={0};

	for(int i=0; i<10 ; i++){
	cin>>example;
	for(int ia=0 ; ia<3 ; ia++){
		if(top3[ia]<=example){
			for(int ib=0 ; ib<(2-ia) ; ib++){
				top3[2-ib] = top3[1-ib];
			}
			top3[ia] = example;
			break;
		}
	}
	}
	
	for(int i=0 ; i<3 ; i++){
	cout << top3[i] << endl;
	}

	return 0;
}

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

using namespace std;

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

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

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

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

int main(){
	int b;
	int a[10];
	for (int i=0;i<10;i++){
		cin >> a[i];
		
	}
	for (int d = 0;d<12;d++){
	for (int j = 0;j<9;j++){
		if(a[j]<a[j+1]){
			b = a[j];
			a[j] = a[j+1];
			a[j+1] = b;
		}
	}
	}
	cout << a[0] << endl;
	cout << a[1] << endl;
	cout << a[2] << endl;
	return 0;




}

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

using namespace std;

int main(){
    int height[10];
    for(int i = 0; i < 10; i++){
        scanf("%d", &height[i]);
    }

    sort(height, height + 10, greater<int>());

    printf("%d\n%d\n%d\n", height[0], height[1], height[2]);
    return 0;

}

C++: #include<stdio.h>
#include<vector>
#include<algorithm>

int main(){
    int i;
    int input;
    std::vector<int> height;
    for (i = 0; i < 10; i++){
        scanf("%d", &input);
        height[i] = input;
    }

    std::sort(height.begin(), height.end());

    printf("%d\n", height[0]);
    printf("%d\n", height[1]);
    printf("%d\n", height[2]);

    return 0;
}