Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	mountains := make([]int, 10, 10)

	for i := 0; i < 10; i++ {
		fmt.Scan(&mountains[i])
	}

	sort.Sort(sort.Reverse(sort.IntSlice(mountains)))

	for i := 0; i < 3; i++ {
		fmt.Println(mountains[i])
	}
}

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

using namespace std;

int main() {
    vector<int> container;

    string buff;
    for(int i = 0; i < 10; ++i){
        getline(cin, buff);
        stringstream ss;
        ss << buff;

        int height = 0;
        ss >> height;

        container.push_back(height);
    }

    sort(
         container.begin(),
         container.end(),
         [](int n1, int n2) -> bool {
            return (n1 > n2);
         }
    );

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

    return 0;
}

C++: main(a){for(printf("3776\n2848\n2840\n");~scanf("%d",&a););}

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

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

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

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

    return 0;
}

C++: #include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cctype>
#include<vector>
#include<queue>
#include<map>
using namespace std;

int main() {
	int a, b1 = 0, b2 = 0, b3 = 0;

	for (int i = 0; i < 10; i++) {
		cin >> a;
		if (a > b1) {
			b3 = b2;
			b2 = b1;
			b1 = a;
		}
		else if (a > b2) {
			b3 = b2;
			b2 = a;
		}
		else if (a > b3) {
			b3 = a;
		}
	}

	cout << b1 << endl << b2 << endl << b3 << endl;

	return 0;
}

C++: #include<iostream>

int main(void){
    int height[10];
    for(int i=0;i<10;i++)
        std::cin>>height[i];
    int top[3];
    top[0]=height[0];
    top[1]=top[2]=-1;
    for(int i=1;i<10;i++){
        if(height[i]>=top[0]){
            top[2]=top[1];
            top[1]=top[0];
            top[0]=height[i];
        }
    }
    std::cout<<top[0]<<std::endl<<top[1]<<std::endl<<top[2]<<std::endl;
    return 0;
}

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

using namespace std;

int main(){

  int a[10];fefepjp
  while(cin>>a[0]){
    for(int i=1;i<10;i++)cin>>a[i];
    sort(a,a+10,greater<int>());
    for(int i=0;i<4;i++)
      cout<<a[i]<<endl;
  }
  

  return 0;
}

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

int main(){
	int yama[10], i, p, Flag = 0, t;
	for(i = 0; i < 10; i++)
		cin >> yama[i];
	while(1){
		Flag = 0;
		for(i = 0; i < 10; i++){
			if(i + 1 != 10){
				if(yama[i] < yama[i + 1]){
					t = yama[i];
					yama[i] = yama[i + 1];
					yama[i + 1] = t;
					Flag++;
				}
			}
		}
		if(Flag == 0)
			break;
	}
	cout << yama[0] << "\n";
	cout << yama[1] << "\n";
	cout << yama[2] << "\n";
	return 0;
}

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

using namespace std;

int main()
{
    const int kNumSample = 10;
    const int kNumPrint = 3;

    vector<int> list;
    list.resize(kNumSample, 0);

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

    sort(list.begin(), list.end(), [](const int &a, const int &b){ return a > b; } );
    for(int i = 0; i < kNumPrint; i++)
    {
        cout << list[i] << endl;
    }

    return 0;
}

C++: 
#include <iostream>
using namespace std;
int com(const void *a, const void *b)
{
	return *(int*)b-*(int*)a;
}

int main()
{
	int H[11]={0},*p=H;
	while(cin>>*p++)
	qsort(H,11,sizeof(int),com);
	cout<<H[0]<<endl;
	cout<<H[1]<<endl;
	cout<<H[2]<<endl;
	return 0;
}

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

int main()
{
	int ta=0;
	int top=0,se=0,sa=0;
	int dumy=0;

	for(int i=0;i<10;i++)
	{
		cin>>ta;
		if(ta>sa)
		{
			sa=ta;
		}
		if(sa>se)
		{
			dumy=se;
			se=sa;
			sa=dumy;
		}
		if(se>top)
		{
			dumy=top;
			top=se;
			se=dumy;
		}
		if(sa>se)
		{
			dumy=se;
			se=sa;
			sa=dumy;
		}
	}
	cout<<top<<endl;
	cout<<se<<endl;
	cout<<sa<<endl;

	return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int mount[10];
	for(int f1=0;f1<10;f1++){
		scanf("%d",&mount[f1]);
	}
	int mem;
	for(int f1=0;f1<10;f1++){
		for(int f2=0;f2<10;f2++){
			if(mount[f1]>mount[f2]){
				mem=mount[f1];
				mount[f1]=mount[f2];
				mount[f2]=mem;
			}
		}
	}
	for(int f1=0;f1<3;f1++){
		printf("%d\n",mount[f1]);
	}
	return 0;
}

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

int main(){
	int nyuryoku,high,low,middle,flag;
	
	for(int i=0;i<10;i++){
	cin>>nyuryoku;
	if(flag==0){
	high = nyuryoku;
	}else{
	if(nyuryoku>low){
		if(nyuryoku>middle){
			if(nyuryoku>high){
				high = nyuryoku;
			}else{
				middle = nyuryoku;
		}else{low = nyuryoku;
	}
	}
}
	cout<<highendl<<endl;
	cout<<middle<<endl;
	cout<<low<<endl;
return 0;
}

C++: #import<iostream>
#import<deque>
#import<algorithm>
using namespace std;main(){int n,i;deque<int>h;while(cin>>n)h.push_back(n);sort(h.begin(),h.end());for(i=9;i>6;)cout<<h[i--]<<endl;}

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

int main(){
  vector<int> v(10);
  for(int i=0;i<10;i++)
    cin >> v[i];
  sort(v.begin(), v.end());
  for(int i=0;i<3;i++)
    cout << v[9-i] << endl;
  return 0;
}

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

int main(){
	int num;
	int height[10];
	for(int i=0;i<=9;i++)
		cin>>height[i];

	for(int i=0;i<=9;i++){
		for(int j=i+1;j<=9;j++){
			if(height[i]<=height[j]){
				num=height[i];
				height[i]=height[j];
				height[j]=num;
			}
		}
	}
	for(i=0;i<=2;i++)
		cout<<height[i]<<endl;
	return 0;
}

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

using namespace std;

int main() {

  vector<int> height;
  int h;

  for(int i=0;i<10;i++) {

    cin >> h;

    height.push_back(h);

  }

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

  for(int i=0;i<3;i++) {

    cout << height[9-i] << endl;

  }

  return 0;

}

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

int main(){
	int yama[10], i, p, Flag = 0, t;
	for(i = 0; i < 10; i++)
		cin >> yama[i];
	while(1){
		Flag = 0;
		for(i = 0; i < 10; i++){
			if(yama[i] < yama[i + 1]){
				t = yama[i];
				yama[i] = yama[i + 1];
				yama[i + 1] = t;
				Flag++;
			}
		}
		if(Flag != 0)
			break;
	}
	return 0;
}

C++: #include<stdio.h>

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

		for(int j = 0; j < 3; j++)
		{
			if(biggest3[j] < input)
			{
				int swap = biggest3[j];
				biggest3[j] = input;
				input = swap;
			}
		}
	}

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

	return 0;
}

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

int main()
{
    priority_queue< int,vector<int>,less<int> > que;
    int in;
    
    for(int i = 0; i < 10; i++){
        cin >> in;
        que.push(in);
    }
    
    
    for(int j = 0; j < 3; j++){
        cout << que.top() << '\n';
        que.pop();
    }
    
    return 0;
}

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

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

C++: #include<iostream>
using namespace std;
int main(){
	int takasa[10];
	for(int i=0;i<10;i++){
		cin>>takasa[i];
	}
	for(int i=0;i<9;i++){
		for(int j=i+1;j<10;j++){
			if(takasa[i]<takasa[j]){
				swap(takasa[i],takasa[j]);
			}
		}
	}



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





	return 0;
}

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

int main(){
 int mountain,first=0,second=0,third=0;
 for(int i=0;i<10;i++){
  cin>>mountain;
  if(mountain>first){
   third=second;
   second=first;
   first=mountain;
  }else if(mountain>second){
   third=second;
   second=mountain;
  }else if(mountain>third){
   third=mountain;
  }
 }
 return 0;
}