Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	heighs := make([]int, 10)
	for i := range heighs {
		heighs[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heighs)))
	for i := 0; i < 3; i++ {
		fmt.Println(heighs[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)))

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

first = 0
second = 0
third = 0
i = 0

for i in range(0,9):
    line = int(input())
    
    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: h = []
for i in range(10):
	h.append(input())
h.sort(reverse=True)
for i in range(3):
	print(h[i])

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

print(list[9],list[8],list[7],sep="\n")

Python: a=sorted([int(input()) for _ in range(10)])
print(a[9],a[8],a[7],sep='\n')

Python: def main():
    Array = []
    for i in range(10):
        Array.append(int(input()))
    Array.sort()
    Array.reverse()
    count = 0
    for value in Array :
        if count == 3:
            break
        print(value)
        count+=1



if __name__ == '__main__':
    main()

Python: import sys
heights = []
for l in sys.stdin:
  heights.append(int(l))
heights = sorted(heights, reverse=True)
print(heights[0])
print(heights[1])
print(heights[2])

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

Python: mount_list =[int(input()) for i in range(10)]
top_mount_list = sorted(mount_list,reverse=True)
for i in top_mount_list[:3]:
    print(i)

Python: a = []
for u in range(10):
    a.append(int(input()))
for i in range(3):
    print(max(a))
    a.remove(max(a))

Python: hs = [0] * 10
for i in range(10):
    hs[i] = int(input())
hs = sorted(hs)
for i in range(1, 4):
    print(hs[-i])

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

Python: if __name__ == '__main__':

	tmp = [ int(input()) for _ in range(10)]
	ans = sorted(tmp,reverse=True)

	for i in range(3):
		print(ans[i])

Python: import sys
print('\n'.join(map(str, sorted([int(h.strip()) for h in sys.stdin], reverse=True)[:3])))

Python: n = 0
list = []
while n < 10:
    x = input()
    list.append(x)
    n += 1

list.sort()
print(list[9])
print(list[8])
print(list[7])

Python: # coding: utf-8
# Your code here!
n1=int(input())
n2=int(input())
n3=int(input())
n4=int(input())
n5=int(input())
n6=int(input())
n7=int(input())
n8=int(input())
n9=int(input())
n10=int(input())

n1,n2,n3,n4,n5,n6,n7,n8,n9,n10=sorted([n1,n2,n3,n4,n5,n6,n7,n8,n9,n10])

print(n10)
print(n9)
print(n8)

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

Python: h=sorted([int(input())for _ in range(10)])
print(h[9],h[8],h[7],sep='\n')

Python: Height = [0]*10

for i in range (10):
    Height[i] = int(input("Height of mountain " + str(i+1) + ":"))
Height.sort()
Height.reverse()
for j in range(3):
    print(Height[j])

Python: a=[int(input()) for i in range(10)]
print(sorted(a)[-1])
print(sorted(a)[-2])
print(sorted(a)[-3])

Python: Height = [0]*10

for i in range (10):
    Height[i] = int(input())
Height.sort()
Height.reverse()
for j in range(3):
    print(Height[j])