Problem:


List of Top 3 Hills

There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.

Write a program which prints heights of the top three mountains in descending order.

Input

Height of mountain 1
Height of mountain 2
Height of mountain 3
 .
 .
Height of mountain 10

Constraints

0 ≤ height of mountain (integer) ≤ 10,000

Output

Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain

Sample Input 1

1819
2003
876
2840
1723
1673
3776
2848
1592
922

Output for the Sample Input 1

3776
2848
2840

Sample Input 2

100
200
300
400
500
600
700
800
900
900

Output for the Sample Input 2

900
900
800



Sample input:
1819
2003
876
2840
1723
1673
3776
2848
1592
922


Sample output:
3776
2848
2840

Submission status: Accepted

Solution code:
one=0
two=0
three=0
while 1:
	try:
		i=int(raw_input())
		if one<i:
			three=two
			two=one
			one=i
		elif two<i:
			three=two
			two=i
		elif three<i:
			three=i
    	except:
	    	print"%d"%(one)
	    	print"%d"%(two)
	    	print"%d"%(three)
	    	break

Submission status: Accepted

Solution code:
heights = sorted([input() for _ in xrange(10)])
for i in xrange(1, 4):
    print heights[-i]

Submission status: Accepted

Solution code:
data = [0]

for i in range(10):
    data.append(int(input()))
    
data = sorted(data)
data.reverse()

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

Submission status: Accepted

Solution code:
s = [int(input()) for i in range(10)]
for i in sorted(s)[:-4:-1]:
    print(i)

Submission status: Accepted

Solution code:
height = []
for i in range(10):
    height.append(input())
height.sort(reverse=True)
for i in range(3):
    print(height[i])

Submission status: Accepted

Solution code:
# coding: utf-8
#Problem Name: List of Top 3 Hills
#ID: tabris
#Mail: t123037@kaiyodai.ac.jp

height = [0 for _ in range(10)]
for i in range(10):
    height[i] = int(raw_input())

top3 = sorted(height)[:6:-1]
for h in top3:
    print h

'''
sample input
1819
2003
876
2840
1723
1673
3776
2848
1592
922
'''

Submission status: Accepted

Solution code:
# coding: utf-8
"""
aizu 0001
"""

import sys

# @profile
def main():
    mountaines=[]
    for line in sys.stdin:
        mountaines.append(int( line ))
    mountaines.sort(reverse=True)
    for index,x in enumerate( mountaines ):
        print x
        if index >=2:
            break
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
heights=[]
for i in range(0,10):
	heights.append(input())
heights.sort()
heights.reverse()
for i in range(0,3):
	print heights[i]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
myList = []
for i in range(0,10):
	myList.append(int(input()))

myList.sort()
myList.reverse()

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    a = []
    for i in range(0,10):
        val = input()
        a.append(int(val))

    a.sort()
    a.reverse()
    for i in range(0,3):
        print(a[i])

Submission status: Accepted

Solution code:
a = [input() for i in range(10)]
print max(a)
b = max(a)
a.remove(b)
print max(a)
b = max(a)
a.remove(b)
print max(a)

Submission status: Accepted

Solution code:
arr = []
for i in range(10):
	arr=arr+[int(raw_input())]
arr.sort()
arr.reverse()
for i in range(3):
	print(arr[i])

Submission status: Accepted

Solution code:
l = []
for i in range(10):
	l.append(input())

l.sort()
l.reverse()

for a in l[:3]:
	print a

Submission status: Accepted

Solution code:
inputList = []
while True:
    try:
        num = int(input())
    except EOFError:
        break
    inputList.append(num)

inputList.sort()
length = len(inputList)
for i in range(3):
    print(inputList[length - i - 1])

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

def main():
    List=[]

    for i in range(10):
        a=int(input())
        List.append(a)

    List.sort(reverse=True)
    print(List[0])
    print(List[1])
    print(List[2])
        
 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

arr = []
for i in sys.stdin:
    arr.append(int(i))

arr.sort()
arr.reverse()
for i in range(3):
    print(arr[i])

Submission status: Accepted

Solution code:
lis=[];

for i in range(10):
    h=int(input());
    lis.append(h);
    
for i in range(10):
    for j in range(i+1,10):
        if lis[i]<lis[j]:
            a=lis[i];
            lis[i]=lis[j];
            lis[j]=a;
            
for i in range(3):
    print(lis[i]);

Submission status: Accepted

Solution code:
mountain = []

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

mountain.sort(reverse = True)

for j in range(3):
	print(mountain[j])

Submission status: Accepted

Solution code:
li = sorted([int(input()) for i in range(10)], reverse=True)
print("\n".join(map(str, li[:3])))

Submission status: Accepted

Solution code:
import sys


def main():
    l = []
    for line in sys.stdin.readlines():
        l.append(int(line.rstrip()))

    for _ in range(3):
        print max(l)
        l.remove(max(l))

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = 10*[0]

for i in range(10):
    s[i] = input()

s.sort(reverse = True)

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

Submission status: Accepted

Solution code:
heap = []
while True:
    try:
        n = int(raw_input())
        if len(heap) == 0:
            heap.append(n)
        elif len(heap) == 1:
            if n <= heap[0]:
                heap.append(n)
            else:
                heap.insert(0, n)
        elif len(heap) == 2:
            if n > heap[0]:
                heap.insert(0, n)
            elif n <= heap[1]:
                heap.append(n)
            else:
                heap.insert(1, n)
        elif n > heap[2]:
            if n >= heap[0]:
                heap.insert(0, n)
            elif n >= heap[1]:
                heap.insert(1, n)
            else:
                heap.insert(2, n)
            heap.pop()
    except (EOFError):
        break
for num in heap:
    print num

Submission status: Accepted

Solution code:
# -*- coding: UTF-8 -*-

lst = [int(raw_input()) for i in range(10)]
lst.sort()
lst.reverse()

print lst[0]
print lst[1]
print lst[2]

Submission status: Accepted

Solution code:
mt = []

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

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

Submission status: Accepted

Solution code:
x=sorted([input() for _ in range(10)],reverse=True)[0:3]
for y in x:
    print y

Submission status: Accepted

Solution code:
s=[int(input()) for x in range(10)]
print(sorted(s)[-1])
print(sorted(s)[-2])
print(sorted(s)[-3])

Submission status: Accepted

Solution code:
res = []
while True:
    try:
        n = input()
        res.append(n)
    except EOFError:
    	break
res.sort()
res = res[len(res)-3:]
for x in reversed(res):
	print x

Submission status: Accepted

Solution code:
import sys
heights = []
for i in range(10):
    line = sys.stdin.readline()
    height = int(line)
    heights.append(height)
heights.sort()
heights.reverse()
for i in range(3):
    print (heights[i])

Submission status: Accepted

Solution code:
a=[]
for i in range(1,11):
    b=int(input())
    a.append(b)
a.sort(reverse=True)
for i in range(3):
    print(a[i])

Submission status: Accepted

Solution code:
def get_input():
    while True:
        try:
            yield ''.join(raw_input().strip())
        except EOFError:
            break
height = list(get_input())
height = sorted(map(int,height),reverse=True)
print height[0]
print height[1]
print height[2]

Submission status: Accepted

Solution code:
li = []
for i in xrange(10):
    s = map(str, raw_input().split())
    li.append(int(s[-1]))
li.sort(reverse=True)
for i in xrange(3):
    print li[i]

Submission status: Accepted

Solution code:
a = []
for i in range(10):
    a.append(int(input()))
for i in sorted(a)[-1:-4:-1]:
    print(i)

Submission status: Accepted

Solution code:
mountains = []
for x in range(10):
  mountains.append(int(raw_input()))

mountains.sort()
mountains.reverse()
print mountains[0]
print mountains[1]
print mountains[2]

Submission status: Accepted

Solution code:
import sys
def solve():

    a = []
    for line in sys.stdin:
        a.append(int(line))

    a.sort()
    a.reverse()
    for k in xrange(3):
        print a[k]
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a = []
for line in sys.stdin:
    a.append(int(line))
b = [0, 0, 0]
for i in a:
	j = 0
	while j < 3:
		if i > b[j]:
			b.insert(j, i)
			break
		j += 1

for i in b[:3]:
	print i

Submission status: Accepted

Solution code:
list1=[]
for i in range(10):
    list1.append(int(input()))
list1=sorted(list1)
list1.reverse()
for i in range(3):
    print(list1[i])

Submission status: Accepted

Solution code:
# 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])

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import string
import sys

#??????????????\????????????ip?????\??????
ip = sys.stdin.readlines()
for i in range(len(ip)):
    ip[i] = int(ip[i].strip("\n"))

#??????3??????????????????
h = [0]*3

#?????????????????????
for i in range(len(ip)):
    for j in range(len(ip)):
        if ip[i] > ip[j]:
            tmp = ip[i]
            ip[i] = ip[j] 
            ip[j] = tmp            

for i in range(3):
    if h != 0:
        print(ip[i])

Submission status: Accepted

Solution code:
a = []
for i in range(10):
    a.append(int(raw_input()))
a.sort()
a.reverse()
for i in range(3):
    print a[i]

Submission status: Accepted

Solution code:
mountains = []
for i in range(10):
    mountains.append(int(input()))
for m in sorted(mountains)[-1:-4:-1]:
    print(m)

Submission status: Accepted

Solution code:
a = [0]
for i in range(10):
    if i == 0:
        a[0] = input()
    else:
        a.append(input())
else:
    a.sort()
    a.reverse()
    print a[0]
    print a[1]
    print a[2]

Submission status: Accepted

Solution code:
M = [0 for i in xrange(10)]

for i in xrange(10):
    M[i] = int(raw_input())
    
M.sort()
M.reverse()

for i in xrange(3):
    print M[i]

Submission status: Accepted

Solution code:
height=[]
for i in xrange(10):
    mountain=input()
    height.append(mountain)
height.sort()
height.reverse()
for i in xrange(3):
    print(height[i])

Submission status: Accepted

Solution code:
mtheight = []
 
for i in xrange(0,10):
    mtheight.append(input())
 
mtheight.sort()
for i in xrange(0,3):
    print mtheight[9 - i]

Submission status: Accepted

Solution code:
m=[]
for i in range(10):
    x = input()
    m.append(x)
m.sort()
m.reverse()
for i in range(0,3):
    print m[i]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

l = []
for i in xrange(10):
    a = input()
    l.append(a)

for n in xrange(3):
    print(max(l))
    l.remove(max(l))

Submission status: Accepted

Solution code:
x = []

for i in xrange(10):
    x.append(input())

x.sort()
x = x[::-1]
for i in xrange(3):
    print x[i]

Submission status: Accepted

Solution code:
A=[]
for i in range(10):
	A.append(int(input()))

A.sort()
A.reverse()
for i in range(3):
	print(A[i])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

hills_list = []
while len(hills_list) != 10:
    hills = raw_input()
    if (10000 >= int(hills)) and (int(hills) >= 0):
        hills_list.append(int(hills))
hills_list.sort()
print hills_list[-1]
print hills_list[-2]
print hills_list[-3]

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

    a.sort()
    a.reverse()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
mountains = []
for n in range(10):
	mountains.append(int(input()))

mountains.sort()
mountains.reverse()

for n in [0,1,2]:
	print(mountains[n])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys

def merge(A, left, mid, right):
    n1 = mid-left
    n2 = right-mid
    L = [0]*(n1+1)
    R = [0]*(n2+1)
    for i in range(n1):
        L[i] = A[left+i]
    for i in range(n2):
        R[i] = A[mid+i]
    L[n1] = R[n2] = sys.maxint
    i = j = 0
    for k in range(left, right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1

def mergeSort(A, left, right):
    if left+1 < right:
        mid = (left+right)/2
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right)

M = [int(raw_input()) for i in range(10)]
mergeSort(M, 0, len(M))
for i in range(1, 4):
    print M[len(M)-i]

Submission status: Accepted

Solution code:
import sys
ms =list(map(int, sys.stdin.read().rstrip('\n').split('\n')))
ms.sort()
ms.reverse()
for i in range(3):
    print(ms[i])

Submission status: Accepted

Solution code:
height_list = []
for i in range(10):
    height_list.append(input())
height_list.sort()
height_list.reverse()

for height in height_list[:3]:
    print height

Submission status: Accepted

Solution code:
# coding: utf-8

list = []
for i in range(10):
    list.append(int(raw_input()))


for i in range(3):
    max = list[0]
    idx = 0
    for i in range(len(list)):
        if i != idx and list[i] > max:
            max = list[i]
            idx = i
    print max
    del list[idx]

Submission status: Accepted

Solution code:
data=[]
for i in range(10):
    data.append(int(input()))
data.sort()
data.reverse()
for i in range(3):
    print(data[i])

Submission status: Accepted

Solution code:
hight = []

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

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

Submission status: Accepted

Solution code:
#List of Top 3 Hills

set = []
a = 9
for i in range(10):
    n = int(input())
    set.append(n)
set.sort()
while a >= 7:
    print(set[a])
    a -= 1

Submission status: Accepted

Solution code:
s = list()

for i in range(10):
    s.append(input())

s.sort(reverse = True)

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

Submission status: Accepted

Solution code:
mounts = []
for i in range(10):
	mounts.append(int(input()))
	
mounts.sort()
mounts.reverse()
for i in range(3):
	print(mounts[i])

Submission status: Accepted

Solution code:
l = []

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

l.sort()

for i in range(3):
    print(l[-1 * (i+1)])

Submission status: Accepted

Solution code:
mounts =[int(input()) for i in range(10)]
mounts.sort(reverse = True)
for i in range(3):
  print(mounts[i])

Submission status: Accepted

Solution code:
A=[]
F=[]
for i in range(0,10):
    B1=raw_input()
    B=int(B1)
    A.append(B)
for i in range(0,10):
    F.append(1)

for num in range(0,3):
    M=0
    m=0
    for i in range(0,10):    
        if(M<A[i]):
            if(F[i]==1):
                M=A[i]
                m=i
    print(M)
    F[m]=0

Submission status: Accepted

Solution code:
import sys

list = []

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

list.sort()
list.reverse()

print list[0]
print list[1]
print list[2]

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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

for i in range(0,10):
    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)

Submission status: Accepted

Solution code:
d = [int(input()) for _ in range(10)]
d.sort(reverse=True)
[print(x) for x in d[:3]]

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [int(input()) for i in range(10)]
for i in sorted(l,reverse=True)[:3]:
    print(i)

Submission status: Accepted

Solution code:
l=[int(input()) for _ in range(10)]
[print(x) for x in sorted(l, reverse=True)[:3]]

Submission status: Accepted

Solution code:
l=[int(input()) for _ in range(10)]
[print(x) for x in sorted(l,reverse=True)[:3]]

Submission status: Accepted

Solution code:
import itertools

l = [int(input()) for i in range(10)]
r = reversed(sorted(l))
for x in itertools.islice(r, 3):
    print(x)

Submission status: Accepted

Solution code:
def qsort(l):
    if l == []: return []
    else:
        pv = l[0]
        left = []
        right = []
        for i in range(1, len(l)):
            if l[i] > pv:
                left.append(l[i])
            else:
                right.append(l[i])
        left = qsort(left)
        right = qsort(right)
        left.append(pv)
        return left + right

def main():
    lst = []
    for i in range(0, 10):
        lst.append(int(raw_input()))

    lst = qsort(lst)
    for i in range(0, 3):
        print(lst[i])

main()

Submission status: Accepted

Solution code:
L=list(range(10))
for i in range(10):
    L[i]=int(input())
print(max(L))
L.remove(max(L))
print(max(L))
L.remove(max(L))
print(max(L))

Submission status: Accepted

Solution code:
order=[]
for number in range(10):
    hight=int(input())
    order.append(hight)
for j in range(9):
    for i in range(9):
        if order[i] < order[i+1]:
            a = order[i]
            b = order[i+1]
            order[i] = b
            order[i+1] = a
for i in range(3):
    print(order[i])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[]

for i in range(10):
	a.append(int(input()))
a.sort()
for i in range(3):
	print(a[9-i])

Submission status: Accepted

Solution code:
mountains = []
for x in range(10):
    mountains.append(int(raw_input()))
mountains.sort()
print(mountains[-1])
print(mountains[-2])
print(mountains[-3])

Submission status: Accepted

Solution code:
data = []
for i in range(10):
    data.append(int(input()))
    
sdata = sorted(data)
for i in range(3):
    print(sdata[9-i])

Submission status: Accepted

Solution code:
M=[]
for i in range(10):
	k=int(input())
	M.append(k)
N=sorted(M)
print(N[-1])
print(N[-2])
print(N[-3])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = []
for i in range(10) :
  a.append(int(input()))

a.sort()
a.reverse()
print("%d\n%d\n%d" % (a[0], a[1], a[2]))

Submission status: Accepted

Solution code:
# coding: utf-8
mountain = [int(input()) for i in range(10)]
for i in range(3):
    print(max(mountain))
    mountain.remove(max(mountain))

Submission status: Accepted

Solution code:
#coding:utf-8

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

h = sorted(h,reverse = True)
for i in h[:3]:
	print(i)

Submission status: Accepted

Solution code:
[print(x) for x in sorted([int(input()) for i in range(10)])[-1:-4:-1]]

Submission status: Accepted

Solution code:
s = []

for i in range(10):
  s.append(int(raw_input()))

s.sort()

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

Submission status: Accepted

Solution code:
m = []
for _ in range(10):
    r = int(input())
    m.append(r)

m.sort()

print (m[9]);
print (m[8]);
print (m[7]);

Submission status: Accepted

Solution code:
a = []
for i in range(10):
    a.append(input())
a.sort()
a.reverse()

print a[0]
print a[1]
print a[2]

Submission status: Accepted

Solution code:
f=s=t=0
for i in range(10):
    n=int(input())
    if(n > f):
        t = s
        s = f
        f = n
    elif(n > s):
        t = s
        s = n
    elif(n > t):
        t = n
print('%d\n%d\n%d'%(f,s,t))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
heightlist = list()
for i in range(10):
	heightlist.append(eval(input()))
heightlist.sort()
for i in range(-1, -4, -1):
	print(heightlist[i])

Submission status: Accepted

Solution code:
heights = []
for _ in range(10):
    heights.append(int(input()))
heights.sort(reverse=True)
for i in range(3):
    print(heights[i])

Submission status: Accepted

Solution code:
import sys

a = sorted([int(x) for x in sys.stdin.readlines()], reverse=True)
for i in range(3):
    print(a[i])

Submission status: Accepted

Solution code:
L = []
for _ in range(10):
    L.append(int(input()))
L.sort(reverse=True)
for m in L[:3]:
    print(m)

Submission status: Accepted

Solution code:
import sys

a = []
for line in sys.stdin:
    a.append(int(line))
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])

Submission status: Accepted

Solution code:
import sys

hills = []
for _ in range(10):
    height = int(sys.stdin.readline().strip())
    hills.append(height)

hills.sort(reverse=True)
for i in range(3):
    print(hills[i])

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
  inp=input()
  a.append(inp)
  if i>=3:
    a.sort()
    del a[0]

print a[2]
print a[1]
print a[0]

Submission status: Accepted

Solution code:
high=[0 for i in range(10)]
for i in range(10):
	high[i]=int(input())
	
ans=[0 for i in range(3)]
for i in range(3):
	ans[i]=max(high)
	high.remove(ans[i])
	print(ans[i])

Submission status: Accepted

Solution code:
import sys

l = sorted(map(int,sys.stdin.readlines()),reverse=True)
for i in l[:3]:
    print(i)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    num = int(input())
    a.append(num)
a=sorted(a)
for i in range(3):
    print('{0}'.format(a[9-i]))

Submission status: Accepted

Solution code:
import sys

li = []
for line in sys.stdin:
   li.append(int(line))
   if len(li) == 10:
      break

li.sort(reverse=True)
li = li[0:3]
for i in li:
   print(i)

Submission status: Accepted

Solution code:
mount = []

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

mount.sort(reverse = True)

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

Submission status: Accepted

Solution code:
h=sorted([int(input()) for i in range(10)],reverse=True)
for i in range(3):
    print(h[i])

Submission status: Accepted

Solution code:
#coding:UTF-8
def LoT(List):
    List2=sorted(List)
    for i in range(3):
        print(List2[len(List)-1-i])
if __name__=="__main__":
    List=[]
    for i in range(10):
        List.append(int(input()))
    LoT(List)

Submission status: Accepted

Solution code:
lis=[]
for i in range(10):
  lis.append(int(input()))
 
for i in sorted(lis,reverse=True)[:3]:
  print(i)

Submission status: Accepted

Solution code:
# your code goes here
import sys

a=[]
for line in sys.stdin:
  line.rstrip('rn')
  tmp=line.split(" ")
  a.append(int(tmp[-1]))

a.sort(reverse=True)
y=0
for i in a:
  if y==3:
    break
  if i>=0 and i<=10000:
    print(i)
    y=y+1

Submission status: Accepted

Solution code:
def main():
    mountain=[]
    for i in range(10):
        num=int(input())
        mountain.append(num)
    mountain=sorted(mountain)
    mountain=mountain[::-1]
    for i in range(3):
        print(mountain[i])

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
a = []
#print(a)
for i in range(10):
  a.append(int(input()))

#print(a)

#print("")
a.sort(reverse=True)

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

Submission status: Accepted

Solution code:
heights = [int(input()) for n in xrange(10)]
for x in xrange(3):
    v = max(heights)
    print v
    heights.remove(v)

Submission status: Accepted

Solution code:
heights = sorted([int(input()) for n in xrange(10)])
for idx in range(-1, -4, -1):
    print heights[idx]

Submission status: Accepted

Solution code:
l = sorted([input() for x in xrange(10)], reverse=True)
for h in l[:3]:
    print h

Submission status: Accepted

Solution code:
ans=[]
for i in range (0,10):
    ans.append(int(input()))
ans.sort(reverse=True)
for i in range (0,3):
    print(ans[i])

Submission status: Accepted

Solution code:
h=[int(input()) for i in range(10)]
h.sort(reverse=True)
[print(i) for i in h[:3]]

Submission status: Accepted

Solution code:
a = sorted([int(input()) for i in range(10)])
a.reverse()
for i in range(3):
	print(a[i])

Submission status: Accepted

Solution code:
import fileinput

def main():
    numbers = []
    for line in fileinput.input():
        numbers.append(int(line))
    numbers = sorted(numbers, reverse=True)
    for n in numbers[0:3]:
        print n

main()

Submission status: Accepted

Solution code:
a = [0, 0, 0, 0]
for t in range(10):
    a[3] = input()
    for i in range(2, -1, -1):
        if (a[i] < a[i+1]):
            a[i], a[i+1] = a[i+1], a[i]

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

Submission status: Accepted

Solution code:
for i in sorted([int(input()) for _ in range(10)], reverse=True)[:3]:
    print(i)

Submission status: Accepted

Solution code:
import sys

heights = sorted([int(h) for h in sys.stdin], reverse=True)

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

Submission status: Accepted

Solution code:
hs = []
for i in range(10):
    hs.append(int(input()))

hs.sort(reverse = True)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys

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

def main():
    data = []
    for line in sys.stdin:
        data.append(int(line))

    for h in top_k_sort(data):
        print(h)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
mol=[]
for i in range(10):
    mol.append(int(input()))

mol.sort(key=None,reverse=True)
for i in range(3):
    print(mol[i])

Submission status: Accepted

Solution code:
for a in sorted([int(input()) for _ in range(10)], reverse=True)[:3]:
    print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a = []
for i in sys.stdin:
    a.append(int(i.replace("\n", "")))
a.sort(reverse=True)
del a[3:]
print( "\n".join(map(str, a)))

Submission status: Accepted

Solution code:
height_list = [int(input()) for i in range(10)]
for i in range(1,4): print(sorted(height_list)[-i])

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n = [0,0,0,0,0,0,0,0,0,0]

for i in range( 0, 10 ):
    n[i] = int(input())

mv = 0
ma = 0

for i in range( 0, 3 ):
    for j in range( 0, 10 ):
        if mv < n[j]:
            mv = n[j]
            ma = j
    print( mv )
    n[ma] = -1
    mv = 0

Submission status: Accepted

Solution code:

l = []
for i in range(0,10):
    l.append(int(input()))

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

Submission status: Accepted

Solution code:
import sys 
height_li = []
for i in range(10):
    height_li.append(int(input()))
for i in range(3):
    print(sorted(height_li,reverse=True)[i])

Submission status: Accepted

Solution code:
A = sorted([int(raw_input()) for _ in xrange(10)])
print A[9]
print A[8]
print A[7]

Submission status: Accepted

Solution code:
# coding: utf-8

#Name: List of Top 3 Hills
#Level: 1
#Category: ????????????
#Note:

s = [int(raw_input()) for i in range(10)]

s.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[print(y) for y in sorted([int(input()) for x in range(10)], reverse=True)[:3]]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Compatible with Python3
# -*- coding: utf-8 -*-
[print(i) for i in sorted([input() for j in range(10)], key=int, reverse=True)[:3]]

Submission status: Accepted

Solution code:
hill = []
while True:
    try:
        hill.append(int(input()))
    except:
        break
for i in range(1, len(hill)):
    key = hill[i]
    j = i-1
    while j >= 0 and hill[j] < key:
        hill[j+1] = hill[j]
        j -= 1
    hill[j+1] = key

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

Submission status: Accepted

Solution code:
heights = []

for _ in range(10):
	heights.append(int(input()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(input()) for i in range(10)]

a.sort()

for i in range(1, 4):
    print(a[-i])

Submission status: Accepted

Solution code:
mountains = [int(input()) for i in range(10)]
for i in sorted(mountains)[7:10][::-1]:
    print(i)

Submission status: Accepted

Solution code:
#coding: utf-8

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

Submission status: Accepted

Solution code:
High = []
for i in range(10):
    High.append(int(input()))
for i in range(3):
    print(max(High))
    High.remove(max(High))

Submission status: Accepted

Solution code:
values = []
for i in range(10):
    values.append(int(input()))

top3 = []
for i in range(3):
    Max = max(values)
    top3.append(Max)
    values.remove(Max)

for x in top3:
    print(x)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    # ??????????????\???
    mountains = [int(input()) for _ in range(10)]

    # ???????????????
    mountains.sort(reverse=True)

    # ???????????????
    print('{0}\n{1}\n{2}'.format(mountains[0], mountains[1], mountains[2]))

Submission status: Accepted

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