Go: package main

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

func getsAsIntArray() (line []int) {
	scanner := bufio.NewScanner(os.Stdin)

	for scanner.Scan() {
		str := scanner.Text()
		if str == "" {
			break
		}
		data, err := strconv.Atoi(str)
		if err != nil {
			break
		}
		line = append(line, data)
	}

	return
}

func main() {

	lines := getsAsIntArray()
	sort.Sort(sort.Reverse(sort.IntSlice(lines)))
	for i, v := range lines {
		if i < 3 {
			fmt.Println(v)
		}
	}
}

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

void swap(int& x, int& y){
    int t = x;
    x = y;
    y = t;
}
int main(){
    int height[10];
    //入力
    for(int i = 0;i < 10;i++){
        cin >> height[i];
        if(height[i] < 0 || height[i] > 10000){
            i--;
        }
    }
    //ソート
    for(int i = 0;i < 10;i++){
        for(int j = i;j > 0;j--){
            if(height[j] > height[j-1]){
                swap(height[j], height[j-1]);
            }
        }
    }
    //出力
    for(int i = 0;i < 3;i++){
        cout << height[i] << "\n";
    }
    return 0;
}

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>());

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

  return 0;
}

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

void listen_hills(std::vector<int> &hills);
void echo_top3(const std::vector<int> &hills);

int main()
{
	using namespace std;
	
	vector<int> hills;
	listen_hills(hills);
	sort(hills.begin(),hills.end(),greater<int>());
	echo_top3(hills);
	
	return 0;
}

void listen_hills(std::vector<int> &hills)
{
	using namespace std;
	int tmp;
	for(int hillCount=0;hillCount<10;hillCount++)
	{
		cin>>tmp;
		hills.push_back(tmp);
	}
}

void echo_top3(const std::vector<int> &hills)
{
	using namespace std;
	vector<int>::const_iterator itr=hills.begin();
	for(int count=0;count<3;count++)
	{
		cout<<*itr++<<endl;
	}
}

C++: #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);

int main() {
	vi num(10);
	REP(i, 10) {
		cin >> num[i];
	}

	sort(RALL(num));
	REP(i, 3) {
		cout << num[i] << endl;
	}

	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int T,t3=0,t2=0,t1=0;
	for(int i=0;i>10;i++){
		cin>>T;
		if(T>=t1){
			t1=T;
			t2=t1;
			t3=t2;
		}
		else if(T>=t2){
			t2=T;
			t3=t2;
		}
		else if(T>=t3){
			t3=T;
		}
		cout<<t1<<endl<<t2<<endl<<t3;
	}
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  int x;
  vector<int>a;
  for(int i=0;i<10;i++){
    cin>>x;
    a.push_back(x);
  }
  sort(a.begin(),a.end()); 
  cout<<a[9]<<endl;
  cout<<a[8]<<endl;
  cout<<a[7]<<endl;
}

C++: #include <iostream>

auto main () -> int
{
    constexpr auto n = 10;
    int highest [3] = {};
    
    for (int i = 0; i < n; ++ i)
    {
        int h;
        std::cin >> h;
        if (highest [0] < h)
        {
            highest [2] = highest [1];
            highest [1] = highest [0];
            highest [0] = h;
        }
        else if (highest [1] < h)
        {
            highest [2] = highest [1];
            highest [1] = h;
        }
        else if (highest [2] < h)
        {
            highest [2] = h;
        }
    }

    for (auto && elem : highest)
    {
        std::cout << elem << std::endl;
    }
}

C++: #include <functional>
#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,greater<int>());
	for (int i = 0; i < 3; i++)
	{
		cout << a[i] << endl;
	}
	return 0;
}

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

int main(){
  vector<int>height(10);
  for(int i=0;i<10;i++){
    cin >> height.at(i);
  }
  for(int j=0;j<10;j++){
    for(int i=0;i<9;i++){
      if(height.at(i)>height.at(i+1)){
        swap(height.at(i),height.at(i+1));
      }
    }
  }
cout <<height.at(9)<<endl;
cout <<height.at(8)<<endl;
cout <<height.at(7)<<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, less<int>());
    for (int i = 9; i > 6; i--){
        cout << a[i] << endl;
    }
}

C++: #include <iostream>                                             
#include <algorithm>                                            
#define N 10                                                    
using namespace std;                                            
                                                                
int main(void) {                                                
  int height[10];                                               
  for (int i=0; i<N; i++) {                                     
    cin >> height[i];                                           
  }                                                             
  sort(height,height+N);                                        
  reverse(height,height+N);                                     
  for (int i=0; i<3; i++) {                                     
    cout << height[i] << endl;                                  
  }                                                             
  return 0;                                                     
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
  vector<int> v;
  int n;
  while(cin >> n){
    v.push_back(n);
  }
  sort(v.begin(), v.end(), greater<int>());
  for(int i = 0; i < 3; i++){
    cout << v[i] << endl;
  }
  return 0;
}

C++: #include<stdio.h>

int main()
{
	int high[10];
	int cases;
	
	for(int i=0;i<9;i++)
	{
		scanf("%d",&high[i]);
	}
	
	
	for(int i=0;i<9;i++)
	{
		for(int j=i+1; j<10; j++)
		{
			if(high[i] < high[j])
			{
				cases = high[i];
				high[i] = high[j];
				high[j] = cases;
			}
		}
	}
	
	printf("%d\n",high[0]);
	printf("%d\n",high[1]);
	printf("%d\n",high[2]);
	
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int main(void)
{
    int a;
    vector<int> v;
    for (int i = 0; i < 10; i++)
    {
        cin >> a;
        v.push_back(a);
    }
    sort(v.begin(), v.end(), greater<int>());
    cout << v[0] << "\n";
    cout << v[1] << "\n";
    cout << v[2] << "\n";
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int m[10],i;
for(i=0;i<10;i++)cin>>m[i];
sort(m,m+10);
cout<<m[9]<<endl<<m[8]<<endl<<m[7]<<endl;
return 0;
}