Go: package main

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

var maxint = 10000
var scanner = bufio.NewScanner(os.Stdin)

func nextInt() (int, error) {
	scanner.Scan()
	return strconv.Atoi(scanner.Text())
}

func main() {
	scanner.Split(bufio.ScanWords)
	arr := make([]int, 10)
	for i := range arr {
		n, _ := nextInt()
		arr[i] = n
	}

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

	arrStr := fmt.Sprintf("%+v", arr[0:3])
	arrStr = arrStr[1:(len(arrStr) - 1)]
	arrStr = strings.Replace(arrStr, " ", "\n", -1)
	fmt.Println(arrStr)
}

C++: #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<numeric>
#include<vector>
#include<iostream>
#include<map>

using namespace::std;

int main(void)
{

  vector<int>h(10);

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

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

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

  return 0;
}

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

using namespace std;

int main()
{
	vector<int> arr(10);
	
	for(int i = 0; i < 10; i++){
		cin >> arr[i];
	}
	
	sort(arr.begin(),arr.end());
	
	printf("%d\n%d\n%d\n",a[10],a[9],a[8]);
	
	return 0;
}

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

using namespace std;

bool cmp (int i,int j) { return (i>j); }

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

C++: #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 999999999
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FFOR(i,a,b) for (int i=(a);i>(b);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
//#define SORT(c) sort((c).begin(),(c).end())
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> Vi;
int a[10];
int main(){
  REP(i,10){
	  cin>>a[i];
  }
  sort(a,a+10);
  FFOR(i,9,6){
	  cout<<a[i]<<endl;
  }
  return 0;
}

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

int main()
{
	priority_queue<int,vector<int>,less<int>> que;
	int in;

	for(int i = 0; i < 10; i++){
		cin >> in;
		que.push(in);
	}


	for(int j = 0; j < 3; j++){
		cout << que.top() << '\n';
		que.pop();
	}

	return 0;
}

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

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

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

using namespace std;

int main(void){
	int hill;

	deque<int> nums;

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

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

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

	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++)
      data[j]<data[i] ? order[j]++ : 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<iostream>
using namespace std;
int main(){
	int a[10];
	for(int i=0;i<10;i++){
		scanf("%d",&a[i]);
		}
		int first=-1;
		int second=-1;
		int third=-1;
		for(int j=0;j<10;j++){
			if(a[j]>first){
				first=a[j];
			}
			else if(a[j]>second){
				second=a[j];
			}
			else if(a[j]>third){
				third=a[j];
			}
		}
		cout<<first<<endl;
		cout<<second<<endl;
		cout<<third<<endl;
		return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <stdio.h>
#define pri(dt) printf("%d\n",dt)
#define RPE0(loopTotal)  for(int i=0;i<=(loopTotal);i++)
#define RPE(loopTotal)  for(int i=1;i<=(loopTotal);i++)

int data[9];

using namespace std;
int main(void){
    
    RPE0(9) scanf("%d",&data[i]);
    sort(data,data+9,greater<int>());
    RPE0(2) pri(data[i]);

}

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

using namespace std;

int main(){

  int a[10];
  while(cin>>a[0]){
    for(int i=1;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 <iostream>
#include <array>

int main(){
    
    int i;
    int max1, max2, max3;
    std::array <int, 10> hill;
    
    max2 = 0;
    max3 = 0;

    for (i = 0; i < 10; ++i) {
        std::cin >> hill.at(i);
        
        if (i == 0) max1 = hill.at(0);
        
        if (max1 < hill.at(i)) { 
            max2 = max1;                    
            max1 = hill.at(i);
        } else if (max2 < hill.at(i)) {
            max3 = max2;
            max2 = hill.at(i);
        } else if (max3 < hill.at(i)) max3 = hill.at(i);
        else {}
    }
    
    std::cout << max1 << std::endl << max2 << std::endl << max3 << std::endl;
    
    return 0;
}

C++: #include<iostream>
#include<queue>
using namespace std;
int main()
{
    int big,meter,i=1;
    priority_queue<int>mountain;
    for(i=0;i<10;i++)
    {
        cin>>meter;
        mountain.push(meter);
    }
        cout<<mountain.top()<<"\n";
        mountain.pop();
        cout<<mountain.top()<<"\n";
        mountain.pop();
        cout<<mountain.top()<<"\n";
        mountain.pop();
    return 0;
}

C++: #include <iostream>
#include <string>   
using namespace std;
 
int main(){
int rank[3],a[10],i = 0,ii = 0,b,c;
rank[0] = 0;
rank[1] = 0;
rank[2] = 0;
while(i <= 9){
	cin >> a[i];
	while(ii <= 2){
		if(rank[ii] < a[i]){
			b = 2 - ii;
			c = ii;
			if(ii == 2){
				rank[2] = a[i];
			}
			if(ii == 1){
				rank[2] = rank[1];
				rank[1] = a[i];
			}
			if(ii == 0){
				rank[2] = rank[1];
				rank[1] = rank[0];
				rank[0] = a[i];
			}		


			break;	
		}
		ii++;
	}
i++;
ii = 0;

}
cout<<rank[0]<<endl<<rank[1]<<endl<<rank[2]<<endl;




}

C++: #include<stdio.h>
#include<algorithm>
int main(){
	int a[10];
	for(int i=0;i<10;i++)scanf("%d",&a[i]);
	std::sort(a,a+10);
	printf("%d\n%d\n%d\n",a[9],a[8],a[7]);
}

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

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

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

int main()
{
	int n[10];
	for (int i = 0; i < 10; i++)
	{
		cin >> n[i];
	}
	//???????????????
	for (int i = 0; i < 10; i++)
	{
		for (int j = i + 1; j < 10; j++)
		{
			if (n[i] < n[j]) swap(n[i], n[j]);
		}
	}
	//??§??????3????????????
	cout << n[0] << endl;
	cout << n[1] << endl;
	cout << n[2] << endl;

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
using namespace std;
typedef long long int ll;
const int INF = 100000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
    const int n = 10;
    vector <int> m(n);
    rep(i, n) cin >> m[i];
    sort(m.begin(), m.end());
    for(int i = n-1; i >= n-3; --i){
        cout << m[i] << endl;
    }
    return 0;
}