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 <stdio.h>
#include <stdlib.h>
#include <math.h>
#pragma warning(disable:4996)

int main()
{

	int MontainIn[10];

	for (int nCnt = 0; nCnt < 10; nCnt++)
		scanf("%d", &MontainIn[nCnt]);

	for (int nCnt = 0; nCnt < 10; nCnt++)
	{
		for (int nCnt2 = 0 ; nCnt2 < 10; nCnt2++)
		{
			if (nCnt2 == nCnt)
				continue;

			if (MontainIn[nCnt] > MontainIn[nCnt2])
			{
				MontainIn[nCnt] ^= MontainIn[nCnt2];
				MontainIn[nCnt2] ^= MontainIn[nCnt];
				MontainIn[nCnt] ^= MontainIn[nCnt2];
			}
		}
	}

	for (int nCnt = 0; nCnt < 3; nCnt++)
		printf("%d\n", MontainIn[nCnt]);

	return 0;
}

C++: #include <stdio.h>

void bubble_sort(int[10]);

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

	bubble_sort(height);

	printf("--\n");
	for(i=9; i>6; --i){
		printf("%d\n", height[i]);
	}
	
	return 0;
}

void bubble_sort(int a[10]){
	int i, j, k;
	for(i=9; i>0; --i){
		for(j=0; j<i; ++j){
			if(a[j+1] < a[j]){
				k = a[j+1];
				a[j+1] = a[j];
				a[j] = k;
			}
		}
	}
}

C++: #include <iostream>
#include <array>
#include <utility>

template<class T>
T input()
{
	T val;
	std::cin >> val;
	return val;
}

int main()
{
	std::array<int, 10> high;
	for (int i = 0; i < 10; ++i)
		high[i] = input<int>();

	std::sort(high.begin(), high.end());

	std::cout << high[9] << " " << high[8] << " " << high[7] << std::endl;
}

C++: #include<cstdio>

int partition(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++;
            int temp = A[i];
            A[i] = A[j];
            A[j] = temp;
        }
    }
    int temp = A[i+1];
    A[i+1] =A[r];
    A[r] =temp;
    return i+1;
}

void quickSort(int A[], int p, int r){
    if(p<r){
        int q = partition(A, p, r);
        quickSort(A, p, q-1);
        quickSort(A, q+1, r);
    }
}

int main(int argc, char const *argv[])
{
    int H[10];
    for(int i=0; i<10; i++) scanf("%d", &H[i]);

    quickSort(H, 0,10-1);
    for(int i=0; i<3; i++) printf("%d\n", H[9-i]);
    return 0;
}

C++: #include <stdio.h>
main(){
  int h[10];
  int st,nd,rd,i;
  st = 0;
  nd = 0;
  rd = 0;
  for(i=0;i<10;i++){
    scanf("%d",&h[i]);
    if(h[i]>=st){
      st = h[i];
    }else if(h[i]>=nd){
      nd = h[i];
    }else if(h[i]>=rd){
      rd = h[i];
    }
  }
  printf("%d\n%d\n%d\n",st,nd,rd);
}

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

int main()
{
	int Mt[9];
	int i,w,max,second,third;
	
	for ( i = 0; i <= 9; i++)
	{
		cin >> Mt[i];

	}
	
	 max = Mt[0];

	for (i = 0; i <= 9; i++)
	{
		
		w = Mt[i];

		if (max < Mt[i])
		{
			Mt[i] = max;
			max = w;
		} //max??????

		//max,second,third????????????
	}
	
	 second = Mt[1];
    
	for (i = 1; i <= 9; i++)
	{
		w = Mt[i];

		if (second < Mt[i])
		{
			Mt[i] = second;
			second = w;
		}
	}

	 third = Mt[2];

	 for (i = 2; i <= 9; i++)
	 {
		 w = Mt[i];

		 if (third < Mt[i])
		 {
			 Mt[i] = third;
			 third = w;
		 }
	 }

	cout << max << endl;
	cout << second << endl;
	cout << third << endl;
  return 0;
}

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<3;i++){
		printf("%d\n",r[i]);
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(){
    string line;
    for(;getline(cin,line);){
        for(int i=0;i<line.size();i++)line[i]=toupper(line[i]);
        cout<<line<<endl;
    }
}

C++: //
//  main.cpp
//  Sample
//
//  Created by h3037183 on 2017/07/31.
//  Copyright ?? 2017??´ ?°????. All rights reserved.
//

#include <iostream>
#include<algorithm>
using namespace std;
int main(){
    int a[10],i;
    for(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;
int main() {
int a[10];
int b;
for(int i=0;i<10;i++){
cin>>b;
a[i]=b;
}
sort(a,a+10,greater<int>());
cout<<a[0]<<endl;
cout<<a[1]<<endl;
cout<<a[2]<<endl;
return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int i,m[10],count,st = 10000;
	for(i = 0;i < 10;i++){
	scanf("%d",&m[i]);
	}
	while(count<3)
	{
		
		for(i = 0;i < 10;i++)
		{
			if(m[i] == st){
				printf("%d\n",m[i]);
				count++;
				break;
			}
		}
		st--;
	}
	return 0;
}

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int a[10];
  int i,k;
  for(i=0;i<10;i++){
    cin>>a[i];
  }
  for(i=9;i>0;i--){
    for(k=i-1;k>-1;k--){
      if(a[i]<a[k]) swap(a[i],a[k]);
    }
  }
  cout<<a[9]<<endl;
  cout<<a[8]<<endl;
  cout<<a[7]<<endl;
  return 0;
}

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

int main(){

??????int data[10];

    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;
    }

    return 0;
}

C++: #include<iostream>

using namespace std;

//??\?????????
void swap(int *a, int *b){
	int temp = *a;
	*a = *b;
	*b = temp;
}

int main(){
	int str,mt[10];
	int i;
	
	for(i=0;i<10;i++){
		cin >> str;
		mt[i]=str;
	}
	
	// ????????????
	int num = 1;
	while(num<=3){
		str = mt[num-1];
		for(i=num;i<=10;i++){
			if(str<mt[i]){
				str = mt[i];
				swap(mt[num-1],mt[i]);
			}
		}
		num++;
	}
	
	cout << mt[0] << "\n";
	cout << mt[1] << "\n";
	cout << mt[2] << "\n";
	
	return 0;
}

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

using namespace std;

int main() {
  int h;
  vector<int> m;
  for(int i = 0; i < 10; i ++) {
    cin >> h;
    m.push_back(h);
  }

  sort(m.begin(), m.end());
  

  for(int i = 1; i <= 3; i ++) {
    cout << m[m.size()-i] << endl;
  }

  return 0;
}

C++: #include<stdio.h>

int main()
{
int x,t1,t2,t3;
t1=0;t2=0;t3=0;
for(int i=0;i<10;i++){
scanf("%d",&x);
if(x>t1){t3=t2;t2=t1;t1=x;}
else if(x>t2){t3=t2;t2=x;}
else if(x>t3)t3=x;
}
printf("%d\n%d\n%d\n",t1,t2,t3);

return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD 1000000007
 
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template <class T>
void print(T& x){printf("%d\n", x);}
void printvec(vector<int> a){
    rep(i, a.size()-1){
        printf("%d ", a[i]);
    }
    printf("%d\n", a[a.size()-1]);
}
 
int main()
{
    int first=0, second=0, third=0, tmp;
    while(scanf("%d", &tmp)!=EOF){
        if(tmp >= first){
            third = second;
            second = first;
            first = tmp;
        }else if(tmp >= second){
            third = second;
            second = tmp;
        }else if(tmp > third){
            third = tmp;
        }
    }

    printf("%d\n%d\n%d\n", first, second, third);
    return 0;
}