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>                                                                 
#include<algorithm>                                                                
                                                                                   
int main(void){                                                                    
  int munt[10] ,i;                                                                 
                                                                                   
  for(i=0;i<10;i++){                                                               
    std::cin >> munt[i];                                                           
  }                                                                                
  std::sort(munt,munt +10);                                                        
  for(i=9;i>6;i--){                                                                
    std::cout << munt[i] << std::endl;                                             
  }                                                                                
                                                                                   
  return 0;                                                                        
}

C++: hoge

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

using namespace std;

int main() {

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

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
	int a = 0, b = 0, c = 0, d = 0;
	for (int i = 0; i < 10; i++){
		cin >> a;
		if (a>b){
			d = c;
			c = b;
			b = a;
		}
		else if (a > c){
			d = c;
			c = a;
		}
		else if (a > d){
			d = a;
		}
	}
	cout << b << endl << c << endl << d;
	return 0;
}

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

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

using namespace std;

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

C++: #include<stdio.h>
int main(void) {
	int c[12],top=0,second=0,thread=0;
	for (time_t i = 1; i <= 10; i++)
	{
		scanf("%d", &c[i]);
		if (c[i]>top)
		{
			second = top;
			top = c[i];
		}
		else
		{
			if (c[i]>second)
			{
				thread = second;
				second = c[i];
			}
			else
			{
				if (c[i]>thread)
				{
					thread = c[i];
				}
			}
		}
	}
	printf("%d\n%d\n%d\n", top, second, thread);
	return 0;
}

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

int main(){
int high[10];
int highest[3]={0,0,0};
for(int i=0;i<10;i++){
cin>>high[i];}
highest[0]=high[0];
for(int i=1;i<10;i++){
if(highest[1]>=high[i]&&high[i]>highest[2]){
highest[2]=high[i];}
if(highest[0]>=high[i]&&high[i]>highest[1]){
highest[2]=highest[1];
highest[1]=high[i];}
if(high[i]>highest[0]){
highest[2]=highest[1];
highest[1]=highest[0];
highest[0]=high[i];}
}
for(int i=0;i<3;i++){
cout<<highest[i]<<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(), greater<int>());
    
    for(int i = 0;i < 3;i++){
        cout << v.at(i) << endl;
    }
    
    
    return 0;
}

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

#define pb push_back
#define fr first
#define sc second
typedef pair<int,int> pii;
typedef vector<int> vi;
const int INF = (1<<25);
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

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

  sort(mount,mount+10);
  printf("%d\n%d\n%d\n",mount[9],mount[8],mount[7]);
}

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

int main() {
	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>
using namespace std;

int main()
{
  int high;
  int temp1,temp2;
  int first=0,second=0,third=0;
  
  for(int i=0;i<10;i++){
    cout<<"山の高さ"<<i<<":";
    cin>>high;
    if(high>first){
      temp1=first;
      first=high;
      temp2=second;
      second=temp1;
      third=temp2;
    } else if (first>high && high>second){
      temp2=second;
      second=high;
      third=temp2;
    } else if (second>high && high>third){
      third=high;
    }
  }

  cout<<"1番目に高い山の高さ:"<<first<<endl;
  cout<<"2番目に高い山の高さ:"<<second<<endl;
  cout<<"3番目に高い山の高さ:"<<third<<endl;
  
  return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int a, b, max = 0, max2 = 0, max3 = 0;
	for (a = 1; a <= 10; a++) {
		scanf("%d", &b);
		if (b > max) {
			max = b;
		}
		else if (b > max2) {
			max2 = b;
		}
		else if (b > max3) {
			max3 = b;
		}
	}
		printf("%d\n %d\n %d\n", max, max2, max3);
		return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int arr[100];
int main(){
	for(int i=0;i<10;i++){
		cin>>arr[i];
	}
	sort(arr,arr+10);
	for(int i=9;i>=7;i--){
		cout<<arr[i]<<endl;
	}
	
}

C++: #include<iostream>
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>
using namespace std;
 
int main(){
  int m[10];
  for(int i=0;i<10;i++)
    cin >> m[i];
  sort(m,m+10);
  cout << m[9] << endl << m[8] << endl << m[7] << endl;
}

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

using namespace std;

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

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

using namespace std;

int MAX(int a,int b){
	if(a>b) return a;
	else return b;
}

int MIN(int a,int b){
	if(a>b) return b;
	if(a<b) return a;
	else return b;
}


int main(){
	int moun[11];
	for(int i=0;i<10;i++)
		cin>>moun[i];
	int no1,no2,no3,n=0,p=0,w=0;
	
	no1=MAX(moun[n],moun[n+1]);
	for(n=2;n<10;n++)
		no1=MAX(no1,moun[n]);

	for(int o=0;o<10;o++){
		if(no1==moun[o]){
			moun[o]=0;
			break;
		}
	}

	no2=MAX(moun[p],moun[p+1]);
	for(p=2;p<10;p++)
		no2=MAX(no2,moun[p]);

	for(int q=0;q<10;q++){
		if(no2==moun[q]){
			moun[q]=0;
			break;
		}
	}

	no3=MAX(moun[w],moun[w+1]);
	for(w=2;w<10;w++)
	no3=MAX(no3,moun[w]);

	for(int l=0;l<10;l++){
		if(no3==moun[l]){
			moun[l]=0;
			break;
		}
	}
	cout<<no1<<" "<<no2<<" "<<no3<<"\n";

	return 0;
}