Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	heighs := make([]int, 10)
	for i := range heighs {
		heighs[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heighs)))
	for i := 0; i < 3; i++ {
		fmt.Println(heighs[i])
	}
}

C++: #include<stdio.h>
#define SIZE 10

/**
 * 関数宣言
 */
void binarySort(int* datas, int size);

int main(){
	int heights[SIZE];
	int i;
	
	for(i = 0; i < SIZE; i++)
	{
		scanf(" %d", heights+i);
	}
	
	binarySort(heights, SIZE);
	binarySort(heights+1, SIZE-1);
	binarySort(heights+2, SIZE-2);
		
	for(i = 0; i < 3; i++)
	{
		printf("%d\n", heights[i]);
	}
	
	
    return 0;
}

void binarySort(int* datas, int size)
{
	int i;
	int tmp;
	
	for(i = size-1; i >= 0; i--)
	{
		if(datas[i] < datas[i+1])
		{
			tmp = datas[i];
			datas[i] = datas[i+1];
			datas[i+1] = tmp;
		}
	}
	
	return;
}

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

C++: #include <iostream>

int main(int argc, char ** argv) {
  int input, top[3] = {0};
  for (int i = 0; i < 10; i++) {
    std::cin >> input;
    if (input >= top[0]) {
      top[2] = top[1];
      top[1] = top[0];
      top[0] = input;
    }else if (input >= top[1]) {
      top[2] = top[1];
      top[1] = input;
    }else if (input >= top[2]) {
      top[2] = input;
    }
  }

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

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

using namespace std;
int main()
{
    int p[10];
    int i;
    for(i=0;i<10;i++)
        scanf("%d",&p[i]);

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

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

        printf("%d\n",p[i]);
        return 0;

}

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

int main(){
    vector<int> heights(10);;
    for(int i = 0; i < 10; ++i){
        cin >> heights[i];
    }
    sort(heights.begin(), heights.end(), greater<int>());

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

    return 0;
}

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

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

C++: #include <stdio.h> using namespace std; int main(){ int count[10001],tmp,num=3; for(int i=0;i<10001;i++)count[i]=0; for(int i=0;i<10;i++){ scanf("%d",&tmp); count[tmp]++; } for(int i=10000;i>=0&&num>0;i--){ if(count[i]>0){ for(int k=0;k<count[i]&&num>0;k++){ printf("%d\n",i); num--; } } } return 0; }

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld",a)

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//char ch;
//string S, T, U;
ll i, j, k, a, b, c, d, f, g, h, l, m, n=10, p, q, r, s, t, w, x, y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int A[10];

    forr(i,n)
    {
        cin>>A[i];
    }
    sort(A,A+n, greater<>());
    forr(i,3)
    {
        cout<<A[i]<<endl;
    }
    return 0;
}

C++: #include<stdio.h>
#define ARRAY_SIZE 10
#define MAX_VALUE 10000
#define MIN_VALUE 0

int searchMax();
int *heightList;

int main(void){
  heightList = new int[ARRAY_SIZE];

  for(int i = 0;i < ARRAY_SIZE;i++){
    scanf("%d",&heightList[i]);
    printf("\ncount %d ; %d\n",i,heightList[i]);
    if(heightList[i] < MIN_VALUE || heightList[i] > MAX_VALUE){
      i--;
      continue;
    }
  }
  for(int i = 0;i < 3;i++){
    printf("%d\n",searchMax());
  }

  delete(heightList);

  return 0;
}

int searchMax(){
  int maxValue = -1;
  int index = -1;

  for(int i = 0;i < ARRAY_SIZE;i++){
    if(maxValue < (heightList[i])){
      maxValue = (heightList[i]);
      index = i;
    }
  }

  if(index != -1){
    (heightList[index]) = 0;
  }
  else{
    return -1;
  }

  return maxValue;
}

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

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

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

using namespace std;

const int N = 10;
int a[N];

int main() {
  for(int i = 0; i < N; i++) {
    scanf("%d", &a[i]);
  }
  sort(a, a+N);
  for(int i = 1; i <= 3; i++) printf("%d/n", a[N-i]);
}

C++: #include <stdio.h>
void SimpleSelectionSort(int* array,int n){
    int temp=0;
    int i = 0;
    int j = 0;

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

    return;

}

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

    SimpleSelectionSort(array , 10);

    for(i = 0;i<3;i++){
        printf("%d\n",array[i]);
    }

    return 0;
}