Go: package main

import(
	"fmt"
	"sort"
)

func main() {
	var a int
	var i int
	dataint := [10]int{}
	i = 0
	for _, err := fmt.Scan(&a); err == nil; _, err = fmt.Scan(&a) {
		dataint[i] = a
		i++
	}
	sort.Ints(dataint[:])
	for i:=9; i>6; i--{
		fmt.Println(dataint[i])
	}
}

C++: #include<iostream>
using namespace std;
void main()
{
	int h[10];
	int i,j,t;
	for(i=0;i<10;i++)
	cin>>h[i];
	for(j=0;j<3;j++)
	{
		for(i=j+1;i<10;i++)
	   {
		 if(h[j]<h[i])
	     {
	     	t=h[j];
	        h[j]=h[i];
	        h[i]=t;
	     }
	   }
	   cout<<h[j]<<endl;
	}
}

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

int main() {
	// your code goes here
	int a[10];

for (int i = 0; i<10; ++i)
{
 scanf("%d",&a[i]);
}
sort(a,a+10);
printf("%d\n",a[9]);
printf("%d\n",a[8]);
printf("%d\n",a[7]);
	 return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main( void )
{
	vector <int> heights;
	for ( int i = 0; i < 10; i++ )
	{
		int height;
		cin >> height;
		heights.push_back( height );
	}

	sort( heights.rbegin(), heights.rend() );

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

	return 0;
}

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

int main(void){
	int x[10],top[3];
	int i;

	for(i=0;i<3;i++){
		top[i] = 0;
	}
	for(i=0;i<10;i++){
		std::cin >> x[i];
		if(top[0] < x[i]){
			top[2] = top[1];
			top[1] = top[0];
			top[0] = x[i];
		}else if(top[1] < x[i]){
			top[2] = top[1];
			top[1] = x[i];
		}else if(top[2] < x[i]){
			top[2] = x[i];
		}
	}

	std::cout << top[0] << "\n" << top[1] << "\n" <<top[2] << "\n";
	return 0;
}

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

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

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

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

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

int main()
{
    int x[10];
    cout << sizeof(x) << endl;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        cin >> x[i];
    int first = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > first)
            first = x[i];
    int second = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > second && first > x[i])
            second = x[i];
    int third = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > third && second > x[i])
            third = x[i];
    cout << first << endl;
    cout << second << endl;
    cout << third << endl;
}

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

int main(){
	vector<int>s(10);
	for(int a=0;a<10;a++)cin>>s[a];
	sort(s.begin(),s.end());
	cout<<s[9]<<endl;
	cout<<s[8]<<endl;
	cout<<s[7]<<endl;
	}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
	vector<int> height(10);
	for(int i=0; i<10; i++){
		cin >>height[i];
	}
	sort(height.begin(),height.end(),greater<int>());
	cout <<height[0]<<endl<<height[1]<<endl<<height[2]<<endl;
	return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int high[10] = { };
	int first = 0, second = 0, third = 0;
	
	for(int i = 0; i < 10; i++){
		cin >> high[i];
		
		if(first <= high[i]){
			third = second;
			second = first;
			first = high[i];
		}
		else if(second <= high[i]){
			third = second;
			second = high[i];
		}
		else if(third <= high[i])
			third = high[i];
	}
	
	cout << first << endl << second << endl << third << endl;
	
	
	return 0;
}

C++: #include <cstdio>

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

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

using namespace std;

int main(void){
	// int mountains;
	std::vector<int> mountains;
	for (int i = 0; i < 10; i ++) {
		int temp;
		cin >> temp;
		mountains.push_back(temp);
	}

	sort(mountains.begin(),mountains.end(), greater<int>());
	for (int i = 0; i < 3; i ++) {
		cout << mountains.at(i) << endl;
	}

	return 0;
}

C++: #include <stdio.h>

int height[10];

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

void sorting(){
    for(int numb = 0; numb < 9; numb++){
        for(int num = 0; num < 9-numb; num++){
            if(height[num] < height[num+1]){
                int stock = height[num];
                height[num] = height[num+1];
                height[num+1] = stock;
                printf("processing:%d\n", num);
            }
            printf("array[%d]:%d\n, array[%d]:%d\n",num,height[num], num+1, height[num+1]);
        }
    }
}

int main(){
  scan();
  sorting();
  for(int a = 0; a < 3; a++){
    printf("Height%d: %d\n", a, height[a]); 
  }
  return 0;
}

C++: #include<iostream>
 using namespace std;
int main(){
int input[10];
int first;
int second;
int third;
int i=0;
for(;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 <bits/stdc++.h>
using namespace std;
 
int main(){
	int a[11];
	for(int i=0;i<10;i++){
		cin>>a[i];
	}
	sort(a,a+10);
	cout<<a[9]<<endl<<a[8]<<endl<<a[7];
    return 0;
}

C++: #include <iostream>

using namespace std;

void reverse(int *array, int length) {
	int i;
	int j;
	for(i=0;i<length-1;i++){
		for(j=i+1;j<length;j++){
			if(array[i]<array[j]){
				int temp=array[i];
				array[i]=array[j];
				array[j]=temp;
			}
		}
	}
}

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

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

int main(){
	int n;
	vector<int> high;
	
	for(int i=0 ; i<10 ; i++){
		cin >> n;
		high.push_back( n );
	}
	
	sort( high.begin() , high.end() );

	for(int i=9 ; i>=7 ; i--){
		cout << high.at( i ) << endl;
	}
}

C++: #include<stdio.h>
int main(){

	int yama[10];
	int a, b,c;
	for (a = 0; a < 10; a++){

		scanf("%d", &yama[a]);

	}
	for (a = 0; a < 9; a++){
        
		for (b = 0; b < 9; b++){

			if (yama[b] < yama[b + 1]){

				c = yama[b];
				yama[b] = yama[b + 1];
				yama[b + 1] = c;
			}

		}

	}

	for (a = 0; a < 3; a++){

		printf("%d\n", yama[a]);

	}

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <functional>
int main(){
  int h[10];
  for(int n=0;n<10;n++){
    using std::cin;
    cin>>h[n];
  }
  using std::sort;
  using std::greater;
  sort(h,h+10,greater<int>());
  for(int n=0;n<3;n++){
    using std::cout;
    using std::endl;
    cout<<h[n]<<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] << "\n" << a[8] << "\n" << a[7] << endl;
  return 0;
}

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


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