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:
a = []
for _ in range(10):
    b = int(input())
    a.append(b)
a.sort(reverse = True)
print(a[0])
print(a[1])
print(a[2])

Submission status: Accepted

Solution code:
M = []
 
for i in range(10):
    M+=[int(input())]
     
M.sort()
 
for i in range(3):
    print M[-1-i]

Submission status: Accepted

Solution code:
M=[]
for i in range(1,11):
    #j="number"+str(i)+"  "
    i=input()
    M.append(int(i)) 
  
M.sort(reverse=True)
#print(M[:3])
print(M[0])
print(M[1])
print(M[2])

Submission status: Accepted

Solution code:
def solve():
    from sys import stdin
    f_i = stdin
    
    M = list(int(f_i.readline()) for m in range(10))
    M.sort(reverse=True)
    print(*M[:3], sep='\n')

solve()

Submission status: Accepted

Solution code:
m=list(int(input()) for i in range(10))
m.sort()
h=[print(m[i]) for i in range(9,6,-1)]

Submission status: Accepted

Solution code:
print("\n".join(map(str,sorted(int(input()) for x in range(10))[:-4:-1])))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
T=10
li = []
while T>0:
    H = int(input())
    li.append(H)
    T -= 1
li.sort()
H = len(li)
print(li[H-1])
print(li[H-2])
print(li[H-3])

Submission status: Accepted

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

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

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:
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:
m=[int(input()) for _ in range(10)]
m.sort(reverse=True)
print(m[0])
print(m[1])
print(m[2])

Submission status: Accepted

Solution code:
mountains = list()
for i in range(10):
    mountains.append(int(input()))

for j in range(3):
    print(mountains.pop(mountains.index(max(mountains))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=[]
try:
    while True:
        k.append(int(input()))
except EOFError:
    pass
k.sort()
print(k[-1])
print(k[-2])
print(k[-3])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = sorted([int(input()) for _ in range(10)])
print(a[9])
print(a[8])
print(a[7])

Submission status: Accepted

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

height.sort(reverse=1)

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

Submission status: Accepted

Solution code:
lst = []

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

Submission status: Accepted

Solution code:
import sys
a = []
s = sys.stdin.readline()
while s :
    a.append(int(s))
    s = sys.stdin.readline()
 
a.sort()
a.reverse()
for i in range(3) :
    print(a[i]);

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = []

for _ in range(10):
  l.append(int(input()))
  
l.sort(reverse = True)

for ll in l[:3]:
  print(ll)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(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 = [int(input()) for i in range(10)]

a.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
yama = []
for i in range(10):
    yama.append(int(input()))

yama = sorted(yama , reverse = True)

for n in range(3):
    print(yama[n])

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:
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:
print(*sorted([int(input()) for i in range(10)])[:6:-1], sep='\n')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
list = [int(input()) for i in range(10)]
for h in sorted(list, reverse=True)[:3]:
	print h

Submission status: Accepted

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

height.sort()

for i in range(3):
     print(height[-1-i])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
h = [0] * 10
for i in range(10):
    h[i] = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

sorted_data = sorted(input_data, reverse = True)

N_PRINT_DATA = 3

[print(sorted_data[i]) for i in range(N_PRINT_DATA)]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    a.append(int(input()))
for i in range(3):
    c = 0
    for sample in a:
        if c < sample:
            c = sample
    print(c)
    a.remove(c)

Submission status: Accepted

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

for i in range(3):
    for j in range(i,10):
        if mountain[i] < mountain[j]:
            buff_mt = mountain[i]
            mountain[i] = mountain[j]
            mountain[j] = buff_mt

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

Submission status: Accepted

Solution code:
from sys import argv, stdin, stderr, stdout

heights = []
for i in range(0, 10):
	heights.append(int(stdin.readline()))
heights.sort(reverse=True)
for i in range(0, 3):
	stdout.write("%d\n" % heights[i])

Submission status: Accepted

Solution code:
mount=[]
for i in range(10):
    mount.append(int(input()))
mount.sort()
for j in range(1,4):
    print(mount[-j])

Submission status: Accepted

Solution code:
top=0
sec=0
thi=0

for num in range(10):
	input_num=input()
	x=int(input_num)
	if x>top:
		thi=sec
		sec=top
		top=x
	elif x<=top and x>sec:
		thi=sec
		sec=x
	elif x<=sec and x>thi:
		thi=x

print(top)
print(sec)
print(thi)

Submission status: Accepted

Solution code:
import sys
h=[int(i) for i in sys.stdin]
h.sort()
print(h[-1])
print(h[-2])
print(h[-3])

Submission status: Accepted

Solution code:
i = 0
arr = list()
for i in range(10):
  arr.append(int(raw_input()))

fst = sec = thr = -1

for i in range(10):
  if fst < arr[i]:
    thr = sec
    sec = fst
    fst = arr[i]
  elif sec < arr[i]:
    thr = sec
    sec = arr[i]
  elif thr < arr[i]:
    thr = arr[i]

print fst
print sec
print thr

Submission status: Accepted

Solution code:
data = [int(input()) for i in range(10)]
data.sort()
for j in range(9, 6, -1):
    print(data[j])

Submission status: Accepted

Solution code:
# coding: utf-8

j = [0,0,0,0,0,0,0,0,0,0]

for i in range(0,10):
    j[i] = int(input())
j.sort(reverse=True)

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

Submission status: Accepted

Solution code:
mnt=[]

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

print(f'{mnt[9]}\n{mnt[8]}\n{mnt[7]}')

Submission status: Accepted

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

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

Submission status: Accepted

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

highest1 = mountains[0]
if highest1 < mountains[1]:
  highest2 = highest1
  highest1 = mountains[1]
else:
  highest2 = mountains[1]

if highest1 < mountains[2]:
  highest2, highest3 = highest1, highest2
  highest1 = mountains[2]
elif highest2 < mountains[2]:
  highest3 = highest2
  highest2 = mountains[2]
else:
  highest3 = mountains[2]

for i in range(3,10):
  if highest1 < mountains[i]:
    highest1, highest2, highest3 = mountains[i], highest1, highest2
  elif highest2 < mountains[i]:
    highest2, highest3 = mountains[i], highest2
  elif highest3 < mountains[i]:
    highest3 = mountains[i]

print(highest1)
print(highest2)
print(highest3)

Submission status: Accepted

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

mt.sort()
mt.reverse()

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

Submission status: Accepted

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

Submission status: Accepted

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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

input_arr.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

a.sort()
for i in range(3):
	print(a.pop())

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    lst = []
    for i in range(10):
        n = int(input())
        lst.append(n)
    lst.sort(reverse=True)
    for i in range(3):
        print(lst[i])

Submission status: Accepted

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

Submission status: Accepted

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

x = srt[:6:-1]
for k in x:
    print(k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input() )
b = int(input() )
c = int(input() )
if b > a:
  tmp = a
  a = b
  b = tmp
if c > b:
  tmp = c
  c = b
  b = tmp
if b > a:
  tmp = b
  b = a
  a = tmp
for x in range(7):
  d = int(input() )
  if d > a:
    c = b
    b = a
    a = d
  elif d > b:
    c = b
    b = d
  elif d > c:
    c = d
print(a)
print(b)
print(c)

Submission status: Accepted

Solution code:
mountain_height = []

for i in range(10):
    new_data = int(input())
    mountain_height.append(new_data)

mountain_height.sort()
mountain_height.reverse()

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

Submission status: Accepted

Solution code:
heights = []
for _ in range(10):
  heights.append(int(input()))
heights.sort()
print(heights[-1])
print(heights[-2])
print(heights[-3])

Submission status: Accepted

Solution code:
hills=[]

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = []

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

l.sort(reverse=True)

for ll in l[:3]:
    print(ll)

Submission status: Accepted

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

m.sort()
print(m[-1])
print(m[-2])
print(m[-3])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

l = [int(i) for i in sys.stdin]
l.sort(reverse=True)
for i in range(0, 3):
    print(l[i])

Submission status: Accepted

Solution code:

a=[(1<<29)*-1]*3
for i in range(10):
	h = int(input())
	if h > a[0]:
		a[2]=a[1]
		a[1]=a[0]
		a[0]=h
	elif h > a[1]:
		a[2]=a[1]
		a[1]=h
	elif h > a[2]:
		a[2]=h

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

Submission status: Accepted

Solution code:
mountains = [int(input())for i 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:
hills = [int(input()) for _ in range(10)]
hills.sort(reverse=True)
top_3_hills = hills[:3]
for i in top_3_hills:
    print(i)

Submission status: Accepted

Solution code:
mountain = sorted([int(input()) for _ in range(10)], reverse=True)
ans = mountain[:3]
print('\n'.join(map(str, ans)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,[input() for i in range(10)]))
a.sort()
a.reverse()
for i in range(0,3):
    print(a[i])

Submission status: Accepted

Solution code:
first = 0
second = 0
third = 0
for i in range(10):
    height = int(input())
    if first <= height:
        third = second
        second = first
        first = height
    elif second <= height:
        third = second
        second = height
    elif third <= height:
        third = height
print(first)
print(second)
print(third)

Submission status: Accepted

Solution code:
Mountains=[]
for x in range(10):
	Mountains.append(int(input()))
for y in range(3):
	Top_idx=0
	for i in range (1,10-y):
		if Mountains[Top_idx] < Mountains[i]:
			Top_idx=i
	print(Mountains[Top_idx])
	Mountains.pop(Top_idx)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list=[]
for i in range(0,10):
    n = int(raw_input())
    list.append(n)
    
list.sort(reverse=True)

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

Submission status: Accepted

Solution code:
h = [int(input()) for x in range(10)]
h_s = sorted(h, reverse = True)

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

Submission status: Accepted

Solution code:
xs = [int(input()) for i in range(10)]
xs = list(reversed(sorted(xs)))[:3]
[print(x) for x in xs ]

Submission status: Accepted

Solution code:
print('\n'.join(sorted([input()for _ in range(10)],key=int,reverse=True)[:3]))

Submission status: Accepted

Solution code:
a = []
for i in range(10):
    a.append(int(input()))
#print(a)
ad = sorted(a, reverse=True)
for i in ad[:3]:
    print("{}".format(i))

Submission status: Accepted

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

Submission status: Accepted

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

height_list.sort()
height_list.reverse()

for height in height_list[:3]:
    print(height)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*- 
import sys
import math
n=[]
for i in range(0,10):
  n.append(input())
n.sort()
n=n[::-1]
for i in range(0,3):
  print n[i]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
height = []

for apple in range(10):
	mountain = input()
	height.insert(-1, mountain)
	
height.sort()
height.reverse()

print height[0]
print height[1]
print height[2]

Submission status: Runtime Error

Solution code:
moutain = [0 for i in range(10]
for i in range(10):
    moutain[i] = int(raw_input())
moutain.sort().reverse()
for i in range(3):
    moutain[i]

Submission status: Runtime Error

Solution code:
moutain = [0 for i in range(10)]
for i in range(10):
    moutain[i] = int(raw_input())
moutain.sort().reverse()
for i in range(3):
    moutain[i]

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    hight = input().split()
    num = [int(n) for n in hight]
    print(sorted(num, reverse=True)[0])
    print(sorted(num, reverse=True)[1])
    print(sorted(num, reverse=True)[2])

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    hight = int(input()).split()
    print(sorted(num, reverse=True)[0])
    print(sorted(num, reverse=True)[1])
    print(sorted(num, reverse=True)[2])

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    hight = int(input()).split()
    print(sorted(num, reverse=True)[i] for i in range(0, 3))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <set>
using namespace std;

int main() {
	multiset<int, greater<int>> ms; int temp;
	for (int i = 0; i < 10; i++) {
		cin >> temp; ms.insert(temp);
	}
	multiset<int, greater<int>>::iterator itr = ms.begin();
	for (int i = 0; i < 3; i++, ++itr) {
		cout << *itr << endl;
	}
	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

#list = sys.stdin.readlines()

i=0
list = []
for line in sys.stdin.readlines():
	list.append(int(line.strip("\n")))

print soted(list, reverse=True)[0]
print soted(list, reverse=True)[1]
print soted(list, reverse=True)[2]

Submission status: Runtime Error

Solution code:
import sys
mt_heigts = map(int, sys.stdin.readlines())
mt_heigts.sort(reverse=True)
for height in mt_heights[:3]:
    print height

Submission status: Runtime Error

Solution code:
import sys
mountains = [int(line.readline()) for line in sys.stdin]

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

Submission status: Runtime Error

Solution code:
# coding: UTF-8
inputs=[]
for i in range(1,10):
    inputs.append(input())
inputs.sort(reverse=True)
for i in range(0,3):
    print x[i]

Submission status: Runtime Error

Solution code:
a=[]
b=a.sort()
c=b.reverse()
print(c[0:2])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

sorted(list)
h1 = a[9]
h2 = a[8]
h3 = a[7]

print(h1)
print(h2)
print(h3)

Submission status: Runtime Error

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


    numbers = number.sorted(number)
    print(numbers[9])
    print(numbers[8])
    print(numbers[7])




if __name__=='__main__':
    main()

Submission status: Runtime Error

Solution code:
while 1:
	list = raw_input().split()
	x = int(list[0]) + int(list[1])
	print "%d" % len(str(x))

Submission status: Runtime Error

Solution code:
data = map(int, raw_input().split())
data = sorted(data)
data.reverse()
for i in range(3):
    print data[i]

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
data = map(int, raw_input().split())
data = sorted(data)
data.reverse()

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

Submission status: Runtime Error

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

def main():
    List=[]
    while(True):
        a=input()
        if a=="":
            break
        else:
            List.append(a)

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

Submission status: Runtime Error

Solution code:
input = [12,123,1221,5231,412,5123,4512,21234,21351,1143]
sort_input = input.sort()
for x in range(1,4)
 print sort_input[-x]

Submission status: Runtime Error

Solution code:
input = [12,123,1221,5231,412,5123,4512,21234,21351,1143]
sort_input = input.sort()
for x in range(1,4):
 print sort_input[-x]

Submission status: Runtime Error

Solution code:
input = [12,123,1221,5231,412,5123,4512,21234,21351,1143]
input.sort()
for x in range(1,4):
 print sort_input[-x]

Submission status: Runtime Error

Solution code:
from numpy.random import mtrand

mt = []

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

print(mt.pop(mt.index(max(mt))))
print(mt.pop(mt.index(max(mt))))
print(mt.pop(mt.index(max(mt))))

Submission status: Runtime Error

Solution code:
# - coding:utf-8 -*-
from numpy.random import mtrand

mt = []

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

print(str(mt.pop(mt.index(max(mt)))))
print(str(mt.pop(mt.index(max(mt)))))
print(str(mt.pop(mt.index(max(mt)))))

Submission status: Runtime Error

Solution code:
mt = []

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

mt.sort().reverse()

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

Submission status: Runtime Error

Solution code:
n = input()
#a = [39, 98, 44, 13, 88, 53, 10]
a = [input() for i in range(n)]
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: Runtime Error

Solution code:
N = input()
a = [input() for i in range(N)]
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: Runtime Error

Solution code:
10 = input()
a = [input() for i in range(10)]
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: Runtime Error

Solution code:
n = input()
a = [input() for i in range(10)]
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: Runtime Error

Solution code:
N = input()
a = []
for i in range(N):
    a.append(input())
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: Runtime Error

Solution code:
N = input()
a = []
for i in range(N):
    a.append(input())
b = [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: Runtime Error

Solution code:
array = []
for i in range(10):
 line = int(input())
 array += [line]

result = array.sort()[::-1]

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

Submission status: Runtime Error

Solution code:
import string

h = input().split()
for i in range(len(h)):
    for j in range(len(h)-1):
        if h[i] < h[j]:
            h[i] = h[j] 
print(h[0])
print(h[1])
print(h[2])

Submission status: Runtime Error

Solution code:
import string

h = input().split()
for i in range(len(h)):
    for j in range(len(h)-1):
        if int(h[i]) > int(h[j]):
            tmp = h[i]
            h[i] = h[j] 
            h[j] = tmp
print(h[0])
print(h[1])
print(h[2])

Submission status: Runtime Error

Solution code:
import string

count = 0
try:
    count += 1
    h[count] = int(input())
except:
    print("??????")

for i in range(len(h)):
    for j in range(len(h)-1):
        if int(h[i]) > int(h[j]):
            tmp = h[i]
            h[i] = h[j] 
            h[j] = tmp            
print(h[0])
print(h[1])
print(h[2])

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
fake = height of mountain[:]
while len(fake)> 7:
    print max(fake)
    fake.remove(max(fake))

Submission status: Runtime Error

Solution code:
l = []

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

l.sort()

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