Go: package main

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

func main() {
	mountHeightList := make([]int64, 10)
	scanner := bufio.NewScanner(os.Stdin)
	for i := 0; i < 10; i++ {
		scanner.Scan()
		mountHeightList[i], _ = strconv.ParseInt(scanner.Text(), 10, 64)
	}

	sort.Slice(mountHeightList, func(i, j int) bool { return mountHeightList[i] > mountHeightList[j] })

	for i := 0; i < 3; i++ {
		fmt.Printf("%d\n", mountHeightList[i])
	}
}

C++: #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
        vector<int>ar(10);
        for(auto&e:ar){
                scanf("%d",&e);
        }
        sort(ar.begin(),ar.end());
        printf("%d\n%d\n%d\n",ar[9],ar[8],ar[7]);
        return 0;
}

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

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

int main() {
    vector<int> num;
    int n;

    for (int i = 0; i < 10; i++) {
        cin >> n;
        num.push_back(n);
    }

    sort(num.begin(), num.end(), greater<int>());

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int i,j,a[11];
	for(i=1;i<=10;i++){
	cin>>a[i];
	}
	sort(a,a+10);
	for(j=10;j>=8;j--){
		cout<<a[j]<<" ";
	}
return 0;
}

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

using namespace std;

int main()
{
	int mon[10];
	int n1, n2;
	for(int i = 0;i <10; i++){
		cin >> mon[i];
	}
	
	int first = 0;
	for(int i = 0; i < 10; i++){
		if(first < mon[i]){
			first = mon[i];
			n1 = i;
		}
	}
	
	int second = 0;
	for(int i = 0; i < 10; i++){
		if(second < mon[i] && i != n1){
			second = mon[i];
			n2 = i;
		}
	}
	
	int third = 0;
	for(int i = 0; i < 10; i++){
		if(third < mon[i] && i != n1 && i != n2) third = mon[i];
	}
	
	printf("%d\n%d\n%d\n", first, second, third);
	
	return 0;
}

C++: #include <iostream>
#include <set>

int main() {
    std::set<int> s = {1819
,2003
,876
,2840
,1723
,1673
,3776
,2848
,1592
,922};
    auto itr = s.end();
    --itr;
    std::cout << *itr << std::endl;
    --itr;
    std::cout << *itr << std::endl;
    --itr;
    std::cout << *itr << std::endl;
    return 0;
}

C++: #include <iostream>
#include <array>
#include <algorithm>
  
int main(){
    std::array<u_int, 10> heights;
     
    for (u_int i = 0; i < 10; ++i){
        std::cin >> heights[i];
    }
     
    std::sort(heights.begin(), heights.end(), std::greater<u_int>());
     
    for (u_int i = 0; i < 3; ++i){
        std::cout << heights[i] << std::endl;
    }
	
    return 0;
}

C++: //by azidoazideazide(c2n14)
#include<iostream>
#include<string>
#include<cmath>
#include<algorithm> //#include<map>
#include<vector>
using namespace std;
typedef long long ll;
//#include<fstream>
//ifstream fin("rps.in");
//ofstream fout("rps.out");
#define pb push_back
vector<int> v;
int main(){
	ios::sync_with_stdio(0);
	int n;
    while(cin>>n){
        v.pb(n);
    }
    sort(v.begin(),v.end(),[=](int a, int b){return(a>b);});
    cout<<v[0]<<endl<<v[1]<<endl<<v[2]<<endl;
return 0;
}

C++: s[];main(i){for(;~scanf("%d",s);)qsort(s,i++,4,"YXZQQQ\x8b\0+\x02\xc3");printf("%d\n%d\n%d\n",s[9],s[8],s[7]);}

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


int main()
{
	int i[10];
	cin >> i[1] >> i[2] >> i[3] >> i[4] >> i[5] >> i[6] >> i[7] >> i[8] >> i[9] >> i[10];
	sort(i, i+9);
	cout << i[9] << endl;
	cout << i[8] << endl;
	cout << i[7] << endl;

	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int data[10];

int main(){
for(int i=0;i<10;i++)cin>>data[i];
sort(data,data+10,greater<int>());

for(int i=0;i<3;i++)cout<<data[i]<<endl;

}

C++: #include <iostream>
using namespace std ;
int main()
{
int a[10] ;
while(cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>a[8]>>a[9]){
    for(int i=0;i<10;i++)
    {
        for(int j=0;j<10-1;j++)
        {
            if(a[j+1]>a[j])
            {
                int temp=a[j];
                a[j]=a[j+1];
                a[j+1]=temp;
            }
        }
    }
        cout<<a[0]<<endl<<a[1]<<endl<<a[2]<<endl;  
  }
    
}

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]<<endl;
	cout << A[8]<<endl;
	cout << A[7]<<endl;
    return 0;
}

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

int main()
 {
   int a[100];
   for(int i=0;i<=9;i++)
    {
     cin>>a[i];
     }
    for(int j=0;j<=9;j++) {
     for(int k=0;k<=9;k++)
     {
         if(a[j]>a[k])
         {
             int t;
             t=a[j];
             a[j]=a[k];
             a[k]=t;
         }
     }
    }
     for(int g=0;g<=2;g++)
     {
         printf("%d\n",a[g]);
     }

 return 0;
 }

C++: #include<stdio.h>
int main(){
  int n,m[10000],i,sum;
  while(1){
    sum=0;
    scanf("%d",&n);
    if(n==0)break;
    for(i=0;i<n/4;i++){
      scanf("%d",&m[i]);
      sum+=m[i];
    }
    printf("%d\n",sum);
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
    int height[10];
    for(int i=0;i<10;i++)
    {
        scanf("%d",&height[i]);
    }
    int temp;
    for(int i=0;i<10;i++){
            for(int j=i+1;j<=10;j++){
        if(height[i]<height[j]){
                temp=height[i];
            height[i]=height[j];
            height[j]=temp;
        }

            }

    }

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

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

static const int DataMax = 100;

static void input(std::vector<int>& hills)
{
    int val = 0;

    while (std::cin >> val) {
        hills.push_back(val);
    }
}

static int getMax(std::vector<int>& hills)
{
    std::sort(hills.begin(), hills.end());
    int ret = hills.back();
    hills.pop_back();

    return ret;
}

int main()
{
    std::vector<int> vec;

    input(vec);
    for (int i = 0; i < 3; i++) {
        std::cout << getMax(vec) << std::endl;
    }

    return 0;
}

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

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

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

C++: #include<stdio.h>
const int N = 10000;
int main()
{
	int a[N];
	for(int i = 0; i < 10; i++)
	{
		scanf("%d", &a[i]);
	}
	for(int i = 0; i < 10; i++)
	{
		for(int j = 0; j < 10; j++)
		{
			if(a[i] < a[j])
			{
				int temp = a[i];
				a[i] = a[j];
				a[j] = temp;
			} 
		}
	}
	printf("%d\n", a[9]);
	printf("%d\n", a[8]);
	printf("%d\n", a[7]);
	
	return 0;
}

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

#define SIZE 10

using namespace std;

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

	for (int i = 9; i >= 7; i--) {
		cout << list[i] << "\n";
	}
	int n;
	cin >> n;
	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);
	for(int i=0;i<3;i++){
		cout<<a[i]<<endl;
	}
	return 0;
}