Go: package main

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

var (
	n  = 10
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	heights := make([]int, n, n)
	for i := 0; i < n; i++ {
		sc.Scan()
		heights[i], _ = strconv.Atoi(sc.Text())
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heights)))

	for i := 0; i < 3; i++ {
		fmt.Println(heights[i])
	}
}

C++: #include<iostream>
#include<algorithm>
//#include<cmath>
using namespace std;
int main() {
	int i;
	int A[10001];
	for (i = 0; cin >> A[i]; i++);
	sort(A, A + i);
	cout << A[i - 1] << endl << A[i - 2] << endl << A[i - 3] << endl;
	return 0;
}

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 <stdio.h>

int main(void){
	int high[10]={0}, ans[3]={0,-1,-2};
	int i,l;
	
	for(i=0; i<10; i++)
		scanf("%d",&high[i]);
	
	ans[0]=high[0];
	if(ans[0]<high[1]){
	ans[1]=ans[0];
	ans[0]=high[1];
	}else{
	ans[1]=high[1];
	}
	for(i=2; i<10; i++){
		if(ans[2]<high[i]){
			if(ans[1]<high[i]){
				if(ans[0]<high[i]){
				ans[2]=ans[1];
				ans[1]=ans[0];
				ans[0]=high[i];
				continue;
				}
				ans[2]=ans[1];
				ans[1]=high[i];
				continue;
			}
				ans[2]=high[i];
		}
	}
	for(i=0; i<3; i++)
		printf("%d\n",ans[i]);

	return 0;
}

C++: #include<cstdio>

int main(){
  int data[10],order[10];

  for(int i=0;i<10;i++){
    scanf("%d",&data[i]);
    order[i]=1;
  }

  for(int i=1;i<10;i++)
    for(int j=0;j<i;j++){
      if(data[j]<data[i]) order[j]++;
      if(data[j]>=data[i]) order[i]++;
    }

  for(int i=1;i<=3;i++)
    for(int j=0;j<10;j++)
      if(order[j]==i)
	printf("%d\n",data[j]);
   
  return 0;
}

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int a[100],i,j,temp;
    while(1)
    {
        for(i=0;i<10;i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=0;i<10;i++)
        {
            for(j=1;j<10;j++)
            {
                if(a[j]>a[j-1])
                {
                    swap(a[j],a[j-1]);
                }
            }
        }

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

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

int main(){
	int height[10] = {0};

	for(int i = 0; i < 10; i++){
		cin >> height[i];
	}
	
	int temp = 0;
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 10-i; j++){
			if(height[j] > height[j+1]){
				temp = height[j];
				height[j] = height[j+1];
				height[j+1] = temp;
			}
		}
	}
	
	cout << endl;
	
	cout << height[9] << endl;
	cout << height[8] << endl;
	cout << height[7] << endl;
	
	return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int> v;
int x;
while(cin>>x){
v.push_back(x);
}
sort(v.begin(),v.end());
cout<<v[0]<<endl;
cout<<v[1]<<endl;
cout<<v[2]<<endl;
reutrn 0;
}

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

const static int N = 10;

int partition(vector<int>& A,int p,int r) {
  int x = A[r]; // ?????????????????????
  int i = p - 1;
  for(int j=p;j<r;j++) {
    if(A[j] > x) {
      i++;
      swap(A[i],A[j]);
    }
  }
  swap(A[i+1],A[r]);
  return i+1;
}
void quick_sort(vector<int>& A,int p,int r) {
  if(p < r) {
    int q = partition(A,p,r);
    quick_sort(A,p,q-1);
    quick_sort(A,q+1,r);
  }
}

void sort(vector<int>& vec) {
  quick_sort(vec,0,vec.size()-1);
}

int main() {
  vector<int> hills(N);
  for(int i=0;i<N;i++) {
    scanf("%d",&hills[i]);
  }

  sort(hills);

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

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

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

C++: #include<stdio.h> #include<algorithm> using namespace std; int main(){int a[10];for(int i = 0; i < 10; i++)scanf("%d", &a[i]);std::sort(a);for(int i = 0; i < 3; i++)printf("%d\n", a[i]);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,greater<int>());
  cout << m[0] << endl << m[1]  << endl << m[2] <<endl;
  return 0;
}

C++: #include<stdio.h>
int main(void){
    int d,m1=0,m2=0,m3=0,i;
    for(i=0;i<10;i++){
        scanf("%d",&d);
        if(d>m1){
            m3=m2;
            m2=m1;
            m1=d;
        }else if(d>m2){
            m3=m2;
            m2=d;
        }else if(d>m3){
            m3=d;
        }
    }
    printf("%d\n",m1);
    printf("%d\n",m2);
    printf("%d\n",m3);
    return 0;
}

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

int main(){
  int ans[3] = {0, 0, 0};

  for(int i = 0; i < 10; i++){
    int x;
    cin >> x;

    for(int j = 0; j < 3; j++){
      if(x > ans[j]){
        for(int k = 2; k > j; k--){
          ans[k] = ans[k - 1];
        }
        ans[j] = x;
        break;
      }
    }
  }

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

C++: #include<stdio.h>
int main(){
	int l[10],r[10]={-1};
	int i,j,k,c[10]={11},n=0;
	for(i=0;i<10;i++){
		scanf("%d",&l[i]);
	}
	for(j=0;j<10;j++){
		for(i=0;i<10;i++){
			for(k=0;k<10;k++){
				if(c[k]==i){
					n=1;
				}
			}
			if(!(n==1)){
				if(l[i]>=r[j]){
					r[j]=l[i];
					c[j]=i;
				}
			}
			n=0;
		}
	}
	for(i=0;i<10;i++){
		printf("%d\n",r[i]);
	}
	return 0;
}

C++: #include<iostream>

using namespace std;
int main()
{
int mount[10];
for(int i=0;i<10;i++)
{
cin >> mount[i];
}
int max[3];
max[0] = mount[0];
max[1] = mount[0];
max[2] = mount[0];
for(i=1;i<10;i++)
{
if(mount[i]>max[0])
{
max[0] = mount[i];
}
}
for(i=1;i<10;i++)
{
if(mount[i]>max[1]&&mount[i]!=max[0])
{
max[1] = mount[i];
}
}
for(i=1;i<10;i++)
{
if(mount[i]>max[2]&&mount[i]!=max[0]&&mount[i]!=max[1])
{
max[2] = mount[i];
}
}
cout << max[0] << endl;
cout << max[1] << endl;
cout << max[2] <<endl;
}
return 0;
}

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

using namespace std;


int main()
{
    int a[10], t;
    int i, j, temp;

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

    //sorting
    for(i=0; i<10; i++) {
        for(j=i+1; j<10; j++) {
            if(a[i]<a[j])
            {
                temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
    }

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


}

C++: #include <stdio.h>
#include <stdlib.h>

int compare(const void *a, const void *b)
{
    return *(int*)b-*(int*)a ;
}
int main(void) {
	int i,c,buf,top[10];
	
	for(i = 0; 10 > i; i++){
		scanf("%d", &top[i]);
	}
	qsort(top, 10, sizeof(int), compare);
	printf("%d\n%d\n%d\n",top[0],top[1],top[2]);
	return 0;
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑


int main() {
	vector<int>v;
	for (int i = 0; i < 10; ++i) {
		int n;
		cin >> n;
		v.push_back(n);
	}
	sort(all(v));
	reverse(all(v));
	cout << v[0] << endl << v[1] << endl << v[2] << endl;
}