Go: package main

import(
	"fmt"
	"sort"
)

func main() {
	var a int
	var i int
	dataint := [10]int{}
	i = 0
	for _, err := fmt.Scan(&a); err == nil; _, err = fmt.Scan(&a) {
		dataint[i] = a
		i++
	}
	sort.Ints(dataint[:])
	for i:=9; i>6; i--{
		fmt.Println(dataint[i])
	}
}

Python: import sys

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

for i in range(1,10):
    line = sys.argv[i]
    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: a = []
x = 0

for i in range(10):
    a.append(int(input()))
for i in range(3):
    x = a.index(max(a))
    print(a[x])
    del a[x]

Python: mountains = [int(input()) for _ in range(10)]
for height in sorted(mountains, reverse=True)[:3]:
    print(height)

Python: if __name__=="__main__":
    dataset = []
    for i in range(10):
        a = int(input())
        dataset.append(a)
    print(dataset)
    for j in range(3):
        print(max(dataset))
        dataset.remove(max(dataset))

Python: mtlist=[]

while True:
    mtlist.append(input())
print(list.sort())

Python: a_list = []
for i in range(10):
    while True:
        a = input()
        a = int(a)
        if 0<a and a<10000:break
    a_list.append(a)

for i in range(3):
    print(max(a_list))
    a_list.remove(max(a_list))

Python: arr = []
for i in range (0,10):
    temp = int(input(""))
    arr.append(temp)

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

Python: N = input()

a = []
for i in range(N):
    a.append(input())

a = map(int,a)
a.sort()

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

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

    a.sort()
    a.reverse()

    for i in range(3):
        print(i)

if __name__ == '__main__':
    main()

Python: mountains = [int(input()) for _ in range(10)]

for height in sorted(mountains)[-3:][::-1]:
    print(height)

Python: list = [int(input()) for _ in range(10)]

list.sort(reverse = True)
print(list[0])
print(list[1])
print(list[2])

Python: 
mons = list()

for i in range(0, 10):
    mons.append(int(input()))
mons = sorted(mons)
for i in range(9, 6, -1):
    print(mons[i])

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

Python: n = int(input())
a = [int(input()) for i in range(n)]
for i in range(3):
    m = max(a)
    a.remove(m)
    print (m)

Python: if __name__ == '__main__':
    height = []
    for _ in range(0,10):
        height.append((int)(input()))
    height.sort(reverse = True)
    print(height[0])
    print(height[1])
    print(height[2])

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

for i in range(1,4):
    ma=max(y)
    print(ma)
    y.remove(ma)

Python: 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()
print(first)
print(second)
print(third)

Python: a = [int(input()) for i in range(10)]
a.sort()
for i in range(1,4):
    print("%d"%a[-i])

Python: number=[]
while(1):
    try:
        s=int(input(""))
        number.append(s)
    except:break

print(*sorted(number,reverse=True)[0:3],sep='\n')

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

Python: mountain = [int(input()) for _ in range(10)]
mountain.sort()
for _ in -1, -2, -3 : print(mountain[_])

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

Python: a=[]
for i in range(10):
    a.append(int(input()))
a.sort()
a.reverse()
print(str(a[0])+"\n"+str(a[1])+"\n"+str(a[2]))

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

Python: def main():
    moutain = []

    for i in range(0,10):
        n = int(input())
        moutain.append(n)

    temp = sorted(moutain,reverse=True)

    for i in range(0,3):
        print(temp[i])

if __name__ == '__main__':
    main()

Python: # coding: utf-8
# Here your code !
array = []
for i in range(10):
 line = int(input())
 array += [line]

result = sorted(array)[::-1]

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

Python: i = [int(input()) for i in range(10)] #値をリストに入れる
x = sorted(i)
print(x[9])
print(x[8])
print(x[7])

Python: heights = list()
for i in range(10):
    heights.append(int(input()))
for height in reversed(sorted(heights))[:3]:
    print(height)

Python: # coding: utf-8

list = []

for i in range(10):
    list.append(int(input()))

slist = sorted(list)

for i in range(3):
    print(slist[9-i])

Python: def main():
    a = []
    for i in range(10):
        a.append(input())

    a.sort()
    a.reverse()

    for i in range(3):
        print(i)

if __name__ == '__main__':
    main()

Python: a=[]
while 1:
    try:
        a.append(int(input()))
    except: break
a.sort(reverse=1)
for i in range(3):print(a[i])

Python: array = [int(input()) for i in range(10)]
array.sort()
for i in range(9,6,-1):
    print(array[i])

Python: #!/usr/bin/env python3
#coding: utf-8

# Volume0 - 0001 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0001)

li = []
for x in range(10):
    s = input()
    int(s)
    li.append(s)

li.sort()
li.reverse()

for y in range(3):
    print(li[y])

Python: h = [int(input()) for i in range(10)]
h.sort(reverse = True)

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

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

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: inp=[]

for i in range(0,10):
    inp.append(input())

INP=[0,0,0,0,0,0,0,0,0,0]

for i in range(0,10):
    for j in range(i+1,10):
        if inp[i]==inp[j]:
            INP[i]+=1
            INP[j]+=1
        elif inp[i]<inp[j]:
            INP[j]+=1
        else:
            INP[i]+=1

z = 0

for i in range(9,-1,-1):
    if z >= 3:
        break
    for j in range(0,10):
        if i == INP[j]:
            print(inp[j])
            z+=1
        if z >= 3:
            break

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

Python: n = 10
f,s,t = -1,-2,-3
for _ in range(n):
    inp = int(input())
    if inp > f:
        f,s,t = inp,f,s
    elif inp > s:
        s,t = inp,s
    elif inp > t:
        t = inp
print(f)
print(s)
print(t)

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

import sys

def top_k_sort(data, k=3, reverse=True):
    data.sort(reverse=True)
    return data[:k]

def main():
    data = map(int, raw_input().split())

    data = [int(v) for v in argv[1:]]
    for h in top_k_sort(data):
        print(h)

if __name__ == '__main__':
    main()

Python: [print(e)for e in sorted([int(input())for _ in range(10)],reverse=True)[0:3]]

Python: A=[]
for i in range(10):
    m=int(input())
    A.append(m)
B=sorted(A)
print(B[-1])
print(B[-2])
print(B[-3])

Python: x=[]
for i in range(10):
    
    n=int(input())
    x.append(n)
x1=sorted(x,reverse=True)

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

Python: h = [int(input()) for i in range(10)]
h.sort(reverse = True)

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

Python: print(*sorted([int(input()) for i in range(10)])[:6:-1], sep='\n')