Go: package main

import (
	"fmt"
	"sort"
)

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

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

	sort.Ints(mt)
	fmt.Printf("%d\n%d\n%d\n", mt[9], mt[8], mt[7])

}

C++: #include <stdio.h>

int main(void) {
	int d,m1,m2,m3,i;
	m1=0;
	m2=0;
	m3=0;
	for(i=0;i<10;i++);{
		scanf("%d",&d);
		if(m1<d){
			m1=d;
		}
		else if(m2<d){
			m2=d;
		}
		else if(m3<d){
			m3=d;
		}
	}
	printf("???????????????????±±?????????%d\n",m1);
	printf("???????????????????±±?????????%d\n",m2);
	printf("???????????????????±±?????????%d\n",m3);
	
	return 0;
}

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

void descending()
{
    int mountain;
    int count[10];
    
    for(int i=0; i<10; i++)
    {
        cin>>mountain;
        count[i]= mountain;
    }
    
     for (int i=0; i<9; i++)    
    {
          for(int j=(i+1); j<10; j++)   
         {
                if (count[i] < count[j])          
               {
                        int temp = count[i];          //swap
                        count[i] = count[j];
                        count[j] = temp;
               }
          }
     }
    
    for(int i=0; i<3; i++)
    {
        cout<<count[i]<<endl;
    }
    
    return;
}


int main(){

    descending();
    return 0;
}

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

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

  sort(h, h+10);

  cout<<h[9]<<h[8]<<h[7]<<endl;
  return 0;
}

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

int main()
{
    int i,j,arr[11];

    for(i=0;i<10;++i)
        scanf("%d",&arr[i]);

    sort(arr,arr+10);

    for(i=9;i>=7;--i)
        printf("%d\n",arr[i]);
    return 0;
}

C++: #include<stdio.h>

int main()
{
  int i;
  int a[10];
  int top1 = 0,top2 = 0,top3 = 0;

  for(i=0;i<10;i++){
    scanf("%d",&a[i]);

    if(top1<a[i]){
      top1 = a[i];
    }
  }
  for(i=0;i<10;i++){
    if(top2<a[i] && a[i]<top1){
      top2 = a[i];
    }
  }
  for(i=0;i<10;i++){
    if(top3<a[i] && a[i]<top2){
      top3 = a[i];
    }
  }


  printf("%d\n",top1);
  printf("%d\n",top2);
  printf("%d\n",top3);
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a;
  int x=0;
  int y=0;
  int z=0;
  for(int i=1;i<=10;i++){
    cin >> a;
    if(a>=x){
      x=a;
    }else if(y<=a<=x){
      y=a;
    }else if(z<=a<=y){
      z=a;
    }
  }
  cout << x << endl;
  cout << y << endl;
  cout << z << endl;
}

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

int main(int argc, char *argv[]){
  int n;
  vector<int> a;
  while(cin >> n){
    a.push_back(-n);
  }
  sort(a.begin(), a.end());
  std::cout << -a[0] << std::endl;
  std::cout << -a[1] << std::endl;
  std::cout << -a[2] << std::endl;
  return 0;
}

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

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

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

int main()
{
priority_queue<int> que;
for(int i=0;i<10;i++)
{
int t;
cin>>t;
que.push(t);
}
for(int i=0;i<3;i++)
{
cout<<que.top()<<endl;
que.pop();
}
return 0;
}

C++: #include <stdio.h>


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

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

using namespace std;

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

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

#define BOGO 10

using namespace std;

int main()
{
	int arr[BOGO];
	srand(static_cast<unsigned int>(time(NULL)));
	
	for(int i = 0; i < BOGO; i++){
		cin >> arr[i];
	}
	
	for(;;){
		
		/**
		for(int j = 0; j < BOGO; j++){
			cout << arr[j] << flush;
		}
		cout << endl;
		/**/
		
		bool found = true;
		for(int j = 0; j < BOGO-1; j++){
			if(arr[j] > arr[j+1]){
				found = false;
				break;
			}
		}
		
		if(found){
			break;
		}
		random_shuffle(arr, arr+BOGO);
	}
	cout << arr[9] << "\n" << arr[8] << "\n" << arr[7] << endl;
}

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

int main()
{
	int array[10];
	for (int i = 0; i < 10; i++) {
		cin >> array[i];
	}
	for (int j = 9; j != 6; j--) {
		for (int i = 0; i < j; i++) {
			if (array[i] > array[i+1]) {
				int spare = array[i];
				array[i] = array[i+1];
				array[i+1] = spare;
			}
		}
		cout << array[j] << endl;
	}
}

C++: #include <iostream>

int main()
{
    int h[10];

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

    for (int i = 0; i < 10; i++)
    {
        for (int n = 0; n < 9; n++)
        {
            if (h[n] < h[n+1])
            {
                std::swap(h[n], h[n+1]);
            }
        }
    }
    
    for (int i = 0; i < 3; i++)
    {
        std::cout << h[i] << std::endl;
    }

    return 0;
}

C++: #include <stdio.h>

int main(void) {
	int n;
	n=0;
	
	if (n<0 && n>10000)
	{
		return 1;
	}
	
	for(n=0; n<10 ;n++)
	{
		printf("height of mountain %d\n", n);
	}
	
	return 0;
}

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

int main() {

	int a = 0, b = 0, c = 0, x;

	while ( ~scanf( "%d", &x ) ) {

		if ( x > a )
			c = b, b = a, a = x;
		else if ( x > b )
			c = b, b = x;
		else if ( x > c )
			c = x;
	}

	printf( "%d\n%d\n%d\n", a, b, c );

	return 0;
}

C++: import java.util.*;

public class Main {
    public static void main(String[] args) {
	Scanner s = new Scanner(System.in);
	int[] dat = new int[10];
	for(int tc = 0; tc < 10; ++tc) {
	    dat[tc] = s.nextInt();
	}
	Arrays.sort(dat);
	for(int i = 0; i < 3; ++i) {
	    System.out.println(dat[9-i]);
	}
    }
}

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

int main(int argc, char const *argv[]) {
  int input_num = 10;

  list<int> ls;

  int height = 0;
  for (size_t i = 0; i < input_num; i++) {
    cin >> height;
    ls.push_back(height);
  }

  ls.sort(std::greater<int>());

  auto it = ls.begin();
  for (int i = 0; i < 3; i++) {
    cout << *it << endl;
    it++;
  }

  return 0;
}

C++: #include <iostream>
#define N 10

using namespace std;

void swap(int& a, int& b){
	int tmp = a;
	a = b;
	b = tmp;
}

void bubble_sort(int mountain[N]){
	for (int i=0; i<N; ++i){
		for (int j=0; j<(N-i); ++j){
			if (mountain[j] < mountain[j+1]){
				swap(mountain[j], mountain[j+1]);
			}
		}
	}
}

int main(void){
	int mountain[N];
	for (int i=0; i<N; ++i){
		int tmp;
		//do{
			cin >> tmp;
			/*if ((tmp<0) || (10000 < tmp)){
				return -1;
			}*/
		//}while ((tmp<0) || (10000 < tmp));
		mountain[i] = tmp;
	}
	bubble_sort(mountain);
	//cout << "output" << endl;
	for (int i=0; i<3; ++i){
		cout << mountain[i] << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

int main(void){
  int a[10];
  rep(i,10)cin>>a[i];
  sort(a,a+10,greater<int>());
  rep(i,3)cout<<a[i]<<endl;
}