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

Python: data_set=[]
for i in range(0,10):
        data_set.append(raw_input())
top=sorted(data_set,reverse=True)
for i in range(0,3):
        print(top[i])

Python: data = []
for i in range(1,11):
	h = int(input())
	data.append(h)

for i in sorted(data)[::-1][0:3]:
	print(i)

Python: inp = input()
a = [input() for i in range(int(inp))]
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])

Python: mou = []
for i in range(10):
    mou.append(int(input()))
    
mou.sort()
print(mou[9])
print(mou[8])
print(mou[7])

Python: height = []
for i in range(10):
    height.append(int(input()))
for i in range(3):
    most = max(height)
    print(most)
    height[index(most)] = 0

Python: def main():
    a=[]
    for i in range(10):
        a.append(int(input()))
    a.sort()
    for j in range(-1, -4, -1):
        print(a[j])

Python: l = [input() for i in range(10)]
m = list(map(int,l))

lst = sorted(m,reverse=True)
for i in range(3):
    print(lst[i])

Python: a = []
for _ in range(10):
    b = int(input())
    a.append(b)
a.sort(reverse = True)
print(a[0])
print(a[1])
print(a[2])

Python: mo = []
for i in range(10):
    h = int(input())
    mo.append(h)

for i in range(10):
    for j in range(9,i,-1):
        if mo[j] < mo[j-1]:
            mo[j],mo[j-1] = mo[j-1],mo[j]

print(mo[9])
print(mo[8])
print(mo[7])

Python: j = []
for i in range(10) :
    j.append(int(input()))
j.reverse()
for k in range(3) :
    print(j[k])

Python: def __main():

    mountains = []
    numOfMoun = 10
 
    for c in range(numOfMoun):
        mountains.insert(c,int(input()))
        
    sorted_mounts = sorted(mountains,reverse=True)
    for k in range(3):
        print(sorted_mounts[k])

__main()

Python: l = []
for i in range(10):
    l.append(int(input()))
l.sort(reverse=True)
for i in range(3):
    print(l[i])

Python: L=[]
for i in range(10):
    a=int(input())
    L.append(a)
    i+=1

for k in range(9,0,-1):
    for l in range(k):
        if L[l]>L[l+1]:
            L[l],L[l+1]=L[l+1],L[l]
        l+=1
    k+=1

for j in range(3):
    print(L[-1])
    L.remove(L[-1])
    j+=1

Python: a = list(map(int,input().split()))
a.sort()
print(a[-1])
print(a[-2])
print(a[-3])

Python: import sys

[print(len(str(y[0] + y[1]))) for y in [[int(z) for z in x.split()] for x in sys.stdin]]

Python: max1 = 0
middle = 0
small = 0
x = 0
for i in range(10):
	x = int(input())
	if max1 < x :
		middle = max1
		max1 = x
		x = 0
	elif middle < x :
		small = middle
		middle = x
		x = 0
	elif small < x :
		small = x
		x = 0
print(max1)
print(middle)
print(small)

Python: height = []
for i in range(10):
    height.append(int(input()))
height.sort()
for i in range(3):
    print(height[i])

Python: m = [int(input()) for _ in range(10)]
m.sort()
[print(m[-i] for i in range(1, 4))]

Python: import sys

first = 0
second = 0
third = 0

for line in open(sys.argv[1],"r"):
    if first < int(line):
        third = second
        second = first
        first = int(line)
    elif second < int(line):
        third = second
        second = int(line)
    elif third < int(line):
        third = int(line)

print(first)
print(second)
print(third)

Python: list = []
for i in range(10):
    list.append(int(input()))
  
list.sort(reverse = True)
for j in range(3):
    print(list[j])

Python: list1 = []
for i in range(1, 11):
    list1.append(input())

for x in range(1, 11):
    for y in range(0, 9):
        if list1[y] < list1[y+1]:
            temp = list1[y]
            list1[y] = list1[y+1]
            list1[y+1] = temp

print(list1[0])
print(list1[1])
print(list1[2])

Python: top_three = [0, 0, 0]
for i in range(10):
    input_height = int(input())
    if top_three[0] < input_height:
        top_three[2] = top_three[1]
        top_three[1] = top_three[0]
        top_three[0] = input_height
    elif top_three[1] < input_height:
        top_three[2] = top_three[1]
        top_three[1] = input_height
    elif top_three[2] < input_height:
        top_three[2] = input_height

print(top_three[0])
print(top_three[1])
print(top_three[2])

Python: line = []
for i in range(10):
    line.append(int(input()))

line.sort(reverse=True)
top3 = line[:3]
for j in top3:
    print(j)

Python: # -*- coding: utf-8 -*-

#a = [input() for i in range(N)]
#print a # [a1, a2, a3, ..., aN]

import sys

a = []
for line in sys.stdin:
    a.append(int(line))
#print a # [a1, a2, a3, ...]
sorted(a, reverse=True)
print(a[0])
print(a[1])
print(a[2])

Python: max1 = 0
middle = 0
small = 0
x = 0
for i in range(10):
	x = int(input())
	if max1 < x :
		middle = max1
		max1 = x
		x = 0
	elif middle < x :
		small = middle
		middle = x
		x = 0
	elif small <= x :
		small = x
		x = 0
	x = 0
print(max1)
print(middle)
print(small)

Python: hight = input().split()
num = [int(n) for n in hight]
print(sorted(num)[-1])
print(sorted(num)[-2])
print(sorted(num)[-3])

Python: a = []
for i in range(10):
    a.append(int(input()))
a.sort()
print("\n".join(list(map(str,a[9:6:-1]))))

Python: list = []
for i in range(10):
    n = int(input())
    list.append(n)
list.sort()
print (list[-1])
print (list[-2])
print (list[-3])

Python: a = []
for i in range(10):
    a.append(int(input()))
a.sort()
print(a[9])
print(a[8])
print(a[7])

Python: import numpy as np
from numpy.random import *

def quicksort(array):
    if len(array) < 2:
        return array # ?????¬??±??????
    else:
        pivot = array[0] # ?????°??±??????
        # ???????????????????°???????????????????????????¨?????????
        less = [i for i in array[1:] if i <= pivot]

        # ????????????????????§??????????????????????????¨?????????
        greater = [i for i in array[1:] if i > pivot]

        return quicksort(less) + [pivot] + quicksort(greater)


array = randint(0, 1000, 10) 
sorted_array = quicksort(array)
print(sorted_array[0])
print(sorted_array[1])
print(sorted_array[2])

Python: max_1 = 0
max_2 = 0
max_3 = 0
for i in range(10):
    m = int(input())
    if max_1 < m:
        max_3 = max_2
        max_2 = max_1
        max_1 = m
    elif max_2 < m:
        max_3 = max_2
        max_2 = m
    elif max_3 < m:
        max_3 = m
print(max_1)
print(max_2)
print(max_3)

Python: import sys

data = sys.stdin.readline()
l = list()
while data:
    l.append(int(data))
    data = sys.stdin.readline()

for x in sorted(l,reverse=True)[:3]:
    print(x)

Python: def quicksort(array):
    if len(array) < 2:
        return array
    else:
        pivot = array[0]
        less = [i for i in array[1:] if i <= pivot]

        greater = [i for i in array[1:] if i > pivot]

        return quicksort(less) + [pivot] + quicksort(greater)


array = []
for _ in range(10):
    array.append(int(input('input integer')))

sorted_array = quicksort(array)
for i in range(3):
    print(sorted_array[9-i])

Python: 
mt=[]
high=[0,0,0]
for i in range(10):
    mt.append(int(input()))
    if  mt[i] > high[0]:
        high=[mt[i]]+high[:2]
    elif mt[i] > high[1]:
        high=[high[0]]+[mt[i]]+[high[1]]
    elif mt[i] > high[2]:
        high=high[:2]+[mt[i]]
print ('\n'.join(map(str,high)))