Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	mt := make([]int, 10)

	for i := 0; i < 10; i++ {
		fmt.Scan(&mt[i])
	}

	sort.Ints(mt)
	fmt.Printf("%d\n%d\n%d\n", mt[9], mt[8], mt[7])

}

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

typedef long long ll;

int main(void)
{
    struct mount {
        ll h1st; ll h2nd; ll h3rd;
    } m;

    m.h1st = 0; m.h2nd = 0; m.h3rd = 0;

    ll mheight;
    for (int i = 0; i < 10; i++) {
        cin >> mheight;
        if (mheight > m.h1st) {
            m.h3rd = m.h2nd;
            m.h2nd = m.h1st;
            m.h1st = mheight;
        } else if (mheight > m.h2nd) {
            m.h3rd = m.h2nd;
            m.h2nd = mheight;
        } else if (mheight > m.h3rd) {
            m.h3rd = mheight;
        }
    }

    cout << m.h1st << endl;
    cout << m.h2nd << endl;
    cout << m.h3rd << endl;

    return 0;
}

C++: #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>

#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#define REPR(i, n) for(int i = (n); i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

#define LL long long int
#define LD long double

#define PI 3.14159265358979

using namespace std;

//================================================
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	vector<int>ans(10);
	int N;

	REP(i, 10) cin >> ans[i];
	DESCSORT(ans);
	REP(i, 3) cout << ans[i] << "\n";
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

typedef long long ll;

constexpr int INF = 1e8;
constexpr int MOD = 1e9+7;

int main(void) {
    int i;
    int a[10];
    REP (i,10) cin >> a[i];
    sort(a,a+10,greater<int>{});
    REP (i,3) cout << a[i] << endl;
    return 0;
}

C++: using namespace std;
int main()
{
    int h[10],i,j,temp;
    for(i=0; i<10; i++)
    {
        cin>>h[i];
    }
    for(i=0; i<10-1; i++)
    {
        for(j=i; j<10; j++)
        {
            if(h[i]<h[j])
            {
                temp=h[i];
                h[i]=h[j];
                h[j]=temp;
            }
        }
    }
    for(i=0; i<3; i++)
    {
        cout<<h[i]<<endl;
    }
}

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

int main(){
  int hills[10];
  for(int i = 0;i < 10;i++){
    scanf("%d",hills + i);
  }
  sort(hills,hills + 10);
  printf("%d\n%d\n%d\n",hills[9],hills[8],hills[7]);
  return 0;
}

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

int main() {
	
	int a=0,b=0,c=0,i,n;
	
	for( i=0 ; i<10 ;i++){
		
		cin>>n;
		
		if(a<n){
			c=b;
			b=a;
			a=n;
		}else if(b<n && n<a){
			c=b;
			b=n;
		}else if(c<n && n<b){
			c=n;
		}
	}
	
	cout<<a<<" "<<b<<" "<<c<<endl;
	
	return 0;
}

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

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

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

int *bubblesort(int a[]) {
	for (int i=0; i < 10; i++) {
		for (int j=0; j < 10 -1- i; j++) {
			if (a[j] < a[j+1]) {
				int temp = a[j];
				a[j] = a[j+1];
				a[j+1] = temp;
			}
		}
	}
	return a;
}

int main() {
	int a[10];
	for (int i = 0;i < 10; i++) {
		cin >> a[i];
	}
	int *b = bubblesort(a);
	for (int t=0; t<3; t++) {
		cout << b[t] << endl;
	}
}

C++: #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
int n;
using namespace std;
int main(){
	priority_queue <int > dp;

	while(cin>>n){
		dp.push(n);
	}
	for(int i=0;i<3;i++){
		int output=dp.top();
		dp.pop();
		cout<<output;
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#define add push_back
#define inf 2147000000

using namespace std;

int main(void){
	int yama[10];
	
	for(int i=0;i<10;i++){
		scanf("%d",&yama[i]);
	}
	
	sort(yama,yama+10);
	
	for(int i=9;i>=7;i--){
		printf("%d\n",yama[i]);
	}
}

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

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

	return 0;
}

C++: #include "stdio.h"
int main()
{
    int a,b,c,x,i;
    a=b=c=-1; i=10;
    while(i--){
        scanf("%d",&x);
        if(x>=a){
            c=b; b=a; a=x;
        }
        else if(x>=b){
            c=b; b=x;
        }
        else if(x>c)
            c=x;
    }
    printf("%d\n%d\n%d\n",a,b,c);
    return 0;
}

C++: #include<algorithm>
#include<functional>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

typedef unsigned long long ull;
typedef long long ll;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

using namespace std;

typedef pair<int ,int > P;

vector<int> vec;

int main()
{
	rep(i,10)
	{
		int a;
		cin>>a;
		vec.pb(a);
	}
	sort(all(vec));

	cout<<vec[9]<<endl;
	
	cout<<vec[8]<<endl;

	cout<<vec[7]<<endl;

	return 0;
}

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

#define NUM 10

int comp(const void *, const void *);

int comp(const void *x, const void *y) {

    return *(const int *)x - *(const int *)y;
    
}

int main(int argc, char *argv[]) {

	int i = 0;
    int Mt[NUM] = {0};

	for(i=0; i<NUM; i++) {
		fscanf(stdin, "%d", &Mt[i]);
	}
	
	qsort(Mt, NUM, sizeof(int *), comp);
	
	for(i=NUM; i>7; i--) {
		fprintf(stdout, "%d\n", Mt[i-1]);
	}

    return 0;

}

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



int main() {

//変数の宣言

	int i,j,temp;
	vector<int> hight;


/////メイン処理/////

	for(i=0;i<10;i++){
		cin >> temp;
		hight.push_back(temp);
	}
	
	for(j=0;j<hight.size()-1;j++){
		for(i=0;i<hight.size()-1-j;i++){
			if (hight[i] > hight[i+1]) {
				temp = hight[i];
				hight[i] = hight[i+1];
				hight[i+1] = temp;
			}
		}
	}
	
	for(i=0;i<3;i++){
		cout << hight[hight.size() -i -1] <<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);
	cout<<a[9]<<endl<<a[8]<<endl<<a[7]<<endl;
	
	return 0;
}

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

void SimpleSort(int* array,int n){
    int temp = 0;
    int i = 0;
    int j = 0;

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

int main(){
    int array[10];

    for(int k=0;k<10;k++){
        cin >> array[k];
    }

    SimpleSort(array,10);

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

    return 0;
}