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;

int main(int argc, char** argv)
{
        int height;
        int first = 0, second = 0, third = 0;
        for (int i = 0; i < 10; i++) {
                cin >> height;
                if (height > first) {
                        third = second;
                        second = first;
                        first = height;
                } else if (height > second) {
                        third = second;
                        second = height;
                } else if (height > third) {
                        third = height;
                }
        }
        cout << first << endl;
        cout << second << endl;
        cout << third << endl;

        return 0;
}

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

int main(){
	const int N=10;
	int date[N];
	int tmp;

	for(int i=0;i<N;i++) cin>>data[i];
	for(int i=1;i<=3;i++){
		for(int j=0;j<N-i;j++){
			if(data[j]>data[j+1]){
				tmp=data[j];
				data[j]=data[j+1];
				data[j+1]=tmp;
			}
		}
	}
	cout<<data[N-1]<<endl<<data[N-2]<<endl<<data[N-3]<<endl;

	return 0;
}

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

ostream &operator<<(ostream &os, __int128_t value) {
  if (ostream::sentry(os)) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[64];
    char *d = end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = end(buffer) - d;
    if (os.rdbuf()->sputn(d, len) != len) {
      os.setstate(ios_base::badbit);
    }
  }
  return os;
}
 
istream &operator>>(istream &is, __int128_t &value) {
  string in;
  is >> in;
  value = 0;
  for (const char &c : in) {
    if ('0' <= c && c <= '9') value = 10 * value + (c - '0');
  }
  if (in[0] == '-') value *= -1;
  return is;
}
 
__int128_t a[15];
 
int main(){
    for(int i=0;i<10;i++){
        cin>>a[i];
    }
    sort(a, a+10);
    cout<<a[9]<<endl
        <<a[8]<<endl
        <<a[7]<<endl;
}

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

void sort(int* rep) {
	bool flg = true;
	int temp;

	do{
		flg = false;
		if (rep[0] < rep[1]) {
			temp = rep[0];
			rep[0] = rep[1];
			rep[1] = temp;
			flg = true;
		}
		if (rep[1] < rep[2]) {
			temp = rep[1];
			rep[1] = rep[2];
			rep[2] = temp;
			flg = true;
		}
	} while (flg);
}




int main() {

	const int SIZE = 10;
	int a[3] = { 0,0,0 };

	cin >> a[0] >> a[1] >> a[2];
	sort(a);

	int value;
	for (int i = 3; i < SIZE; i++) {
		cin >> value;

		if (a[2] < value) {
			a[2] = value;
			sort(a);
		}
	}

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

	}


//	system("pause");
	return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include<functional> 
 
using namespace std;
   
int main(){
   
 int i, height[10];
 for(i=0;i<10;i++){
  scanf("%d", &height[i]);
 }
 sort(height, height+10, greater<int>());
   
 for(i=0;i<3;i++){
  printf("%d\n", height[i]);
 }

 return 0;
}

C++: #include<stdio.h>
int main()
{
int x,t1,t2,t3;
t1=0;t2=0;t3=0;
for(int i=0;i<10;i++){
scanf("%d",&x);
if(x>t1)t1=x;
else if(x>t2)t2=x;
else if(x>t3)t3=x;
}
printf("%d\n%d\n%d\n",t1,t2,t3);

return 0;
}

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

int main()
{
  int a[11]={0};
  int i,j,maxa,maxb,maxc;
  

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

  for(i=0; i<10; i++){
    for(j=0; j<10; j++){
      if(a[i]<a[j]){
	swap(a[i],a[j]);
      }
    }
  }

  maxa=a[0];
  maxb=a[1];
  maxb=a[2];

  printf("%d\n%d\n%d",maxa,maxb,maxc);
  
  return 0;
}

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

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

	printf("%d\n%d\n%d\n", h[1], h[2], h[3]);

	return 0;
}

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

int main() {
	int Height[20];

	for(int i=0; i<10; ++i) cin >> Height[i];

	for(int i=0; i<9; ++i) {
		for(int j=i; j<10; ++j) {
			if(Height[i] < Height[j]) {
				int tmp;
				tmp= Height[i];
				Height[i]= Height[j];
				Height[j]= tmp;
			}
		}
	}

	for(int i=0; i<3; ++i) printf("%d\n", Height[i]);

	return 0;
}

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

int main(){
	int i=0;
	int m[10];
	for(i=0;i<10;i++)
	{
		cin>>m[i];
	}
	
	int temp=0;
	i=0;
	
	for(i=0;i<10;i++)
	{
		if(temp<m[i])
		{
			temp=m[i];
		}
	}
	int f=temp;
	i=0;
	temp=0;
	for(i=0;i<10;i++)
	{
		if(temp<m[i]&&m[i]<f)
		{
			temp=m[i];
		}
	}
	int s=temp;
	i=0;
	temp=0;
	for(i=0;i<10;i++)
	{
		if(temp<m[i]&&m[i]<s)
		{
			temp=m[i];
		}
	}
	int t=temp;
	
	cout<<f<<endl<<s<<endl<<t<<endl;

    return 0;
}

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

int main() {
	int list[10]={};
	
	for(int i=0;i<10;i++){
		cin >> list[i];
		}
	
	for(int x=0;x<10;x++){
		for(int y=0;y<10;y++){
			
			if(list[x]>list[y]){
				int a=list[y];
				list[y]=list[x];
				list[x]=a;
			}
			
		}	
	}
	
	for(int i=0;i<3;i++){
	cout << list[i]<<endl;
	}
	
	
	return 0;
}

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

int main()
{
	int max = 0;
	int max2 = 0;
	int max3= 0;
	int a[10];

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

	for (int i = 0; i < 10; i++) {
		if (max3 < a[i] && a[i] < max2) max3 = a[i];
	}


		printf("%d\n", max);
		printf("%d\n", max2);
		printf("%d\n", max3);

		return (0);
	
}

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

int main(void)
{
  int array[10];
  int i, j;
  int end;
  int temp;
  for(i = 0; i < 10; i ++){
    cin >> array[i];
  }

   while(1){
    end = 0;

    for(j = 0; j < 9; j++){
      
      if(array[j] > array[j + 1]){
	temp = array[j];
	array[j] = array[j + 1];
	array[j + 1] = temp;
	end = 1;

      }

    }

  if(end == 0){ break ; }

  }

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

  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<int> yama(10);
    for(int i=0;i<10;i++){
        cin >> yama[i];
    }
    sort(yama.begin(),yama.end);
    cout << yama[9] << "\n" << yama[8] << "\n" << yama[7] << "\n";
}

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

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

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