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:
#coding: utf-8

a = []

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

a.sort(reverse=True)

for i in range(3):
	print(a[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:
#!/usr/bin/env python

tmp_max = [0,0,0]

import sys
for line in iter(sys.stdin.readline, ""):
	if int(line) > tmp_max[2]:
		tmp_max[2] = int(line)
		if tmp_max[2] > tmp_max[1]:
			tmp_max[1],tmp_max[2] = tmp_max[2],tmp_max[1]
			if tmp_max[1] > tmp_max[0]:
				tmp_max[0],tmp_max[1] = tmp_max[1],tmp_max[0]

print tmp_max[0]
print tmp_max[1]
print tmp_max[2]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = [],[]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[]

for i in range (10):
    c=int(input())
    a.append(c)
    d=sorted(a)

print(d[-1])
print(d[-2])
print(d[-3])

Submission status: Accepted

Solution code:
a=[]

for i in range(10):
    b=int(input())
    a.append(b)
    
for i in range(3):
    print(max(a))
    a.remove(max(a))

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(3):
    maximum = 0
    index = i
    for j in range(i, 10):
        if mountain_heights[j] > maximum:
            maximum = mountain_heights[j]
            index = j
    temp = mountain_heights[i]
    mountain_heights[i] = mountain_heights[index]
    mountain_heights[index] = temp
    print(maximum)

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

for n in range(3):
    s=max(a)
    b.append(s)
    print(s)
    a.remove(s)

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

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    a.append(int(input()))
    a.sort()
print(f'{a[-1]}\n{a[-2]}\n{a[-3]}')

Submission status: Accepted

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

Submission status: Accepted

Solution code:


import sys
a=[]
for i in sys.stdin:
    a.append(int(i))
    
x=sorted(a,reverse=True)
print(x[0])
print(x[1])
print(x[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
a=[]
for i in sys.stdin:
    a.append(int(i))

x=sorted(a,reverse=True)
print(x[0])
print(x[1])
print(x[2])

Submission status: Accepted

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

x.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = []
for i in range(10):
    a.append(int(input()))
b = sorted(a,reverse=True)
print(b[0])
print(b[1])
print(b[2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=[]

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

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

Submission status: Accepted

Solution code:
print(*sorted([int(input()) for _ in range(10)])[:-4:-1], sep="\n")

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

Submission status: Accepted

Solution code:
a = []
for i in range(10):
    a.append(input())
a = sorted(a, key=int, reverse=True)
for i in a[0:3]:
    print(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:
mountain=[]
for i in range(10):
    mountain.append(int(input()))
mountain.sort()
print(mountain[9])
print(mountain[8])
print(mountain[7])

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(3):
    maximum = 0
    index = i
    for j in range(i, 10):
        if a[j] > maximum:
            maximum = a[j]
            index = j
    temp = a[i]
    a[i] = a[index]
    a[index] = temp
    print(maximum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=10
i=0
I=[int(input()) for _ in range (N)]
I.sort()
for i in range(3):
    print(max(I))
    I.pop()

Submission status: Accepted

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

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:
s=[int(input()) for _ in range(10)]
for i in range(3):
    n=max(s)
    print(n)
    s.remove(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list=[]
for i in range(10):
    x=int(input())
    list.append(x)
list=sorted(list,reverse=True)
print(list[0])
print(list[1])
print(list[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])

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

a = []
for i in range(10):
    n = int(input())
    a.append(n)
    a.sort()
print(a[9], a[8], a[7], sep="\n")

Submission status: Accepted

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

Submission status: Accepted

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

y=sorted(x)
print(y[9])
print(y[8])
print(y[7])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

li=[]

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

print(li[-1])
print(li[-2])
print(li[-3])

Submission status: Accepted

Solution code:
S=[int(input()) for i in range(10)]
S.sort(reverse=1)
print(*S[:3],sep='\n')

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
  a.append(int(input()))
b=sorted(a,reverse=True)
print(b[0])
print(b[1])
print(b[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=[int(input()) for i in range(10)]
x.sort()
print('{}\n{}\n{}' . format(x[9],x[8],x[7]))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

a=[]
for i in range(10):
    a.append(input())
a=sorted(a,key=int,reverse=True)
for i in a[0:3]:
    print(i)

Submission status: Accepted

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

y=sorted(x)
print(y[9])
print(y[8])
print(y[7])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

lst.sort(reverse=True)
lst1=lst[0:3]
lst2=lst[1]
print(max(lst1))
print(lst2)
print(min(lst1))

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    a.append(int(input()))
    a.sort()
    
print(f'{a[-1]}\n{a[-2]}\n{a[-3]}')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=[]
for i in range(10):
    a=int(input())
    x.append(a)
    
print(max(x))
print(sorted(x)[-2])
print(sorted(x)[-3])

Submission status: Accepted

Solution code:
h=[]
for i in range(10):
    h.append(int(input()))
h.sort()
print(h[9],h[8],h[7],sep='\n')

Submission status: Accepted

Solution code:
#(49)山の高さ
a=[]
for i in range(10):
     a.append(int(input()))
a.sort()
for i in range(3):
     print(a[-1])
     del a[-1]

Submission status: Accepted

Solution code:

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

size = len(list)
print(list[size-1])
print(list[size-2])
print(list[size-3])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=[]
for i in range(10):
    x=int(input())
    l.append(x)
l1=sorted(l,reverse=True)

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

Submission status: Accepted

Solution code:
L=[]
M=[]
for i in range(10):
    n=int(input())
    L.append(n)
for j in range(3):
    b=max(L)
    M.append(b)
    L.remove(b)
print(M[0])
print(M[1])
print(M[2])

Submission status: Accepted

Solution code:
lst=[]
for x in range (10):
    lst.append(int(input()))
lst.sort()
lst.reverse()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    a.append(int(input()))
a.sort(reverse=True)
print(a[0],a[1],a[2],sep="\n")

Submission status: Accepted

Solution code:
lst=[]
for i in range(10):
    x = int(input())
    lst.append(x)
lstx=sorted(lst)[7:]
print(lstx[2])
print(lstx[1])
print(lstx[0])

Submission status: Accepted

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

    if (0 <= h_input <= 10000):
        h_list.append(h_input)


h_list = sorted(h_list, reverse=True)

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

Submission status: Accepted

Solution code:
l = []
for i in range(10):
    a = int(input())
    l.append(a)
L = sorted(l)
print(L[len(L) - 1])
print(L[len(L) - 2])
print(L[len(L) - 3])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

Solution code:
list = [int(input()) for i in range(10)]
s=0
t=0
u=0
for i in range(10):
    if s<list[i]:
        u=t
        t=s
        s=list[i]
    elif t<list[i]:
        u=t
        t=list[i]
    elif u<list[i]:
        u=list[i]
print(s)
print(t)
print(u)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#49 山の高さ

S = [int(input()) for i in range(10)]

S.sort(reverse = True)

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

Submission status: Accepted

Solution code:
i=1
H=[]
while i<=10:
    h=int(input())
    H.append(h)
    i+=1
H.sort(reverse=True)
for i in range(3):
    print(f'{H[i]}')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[None]*10
i=0
for i in range(10):
    a[i]=input()
a=list(map(int,a))


a.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[int(input()) for i in range(10)]
b=sorted(a, reverse=True)
print(b[0])
print(b[1])
print(b[2])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import deque
lis = []
for i in range(10):
    height = int(input())
    lis.append(height)

lis.sort()
d = deque(lis)

for j in range(3):
    print(d.pop())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
f=int(input())
g=int(input())
h=int(input())
i=int(input())
j=int(input())

k=[a, b, c, d, e, f, g, h, i, j]

k.sort(reverse=True)
t=k[:3]

for i in t[0:]:
    print(i)

Submission status: Accepted

Solution code:
lit=[]
while True:
    try:
        lit.append(input())
    except EOFError:
        break
result=[0,0,0]
for i in lit:
    if int(i) >result[0]:
        result[2]=result[1]
        result[1]=result[0]
        result[0]=int(i)
        
    elif int(i)>result[1]:
        result[2]=result[1]
        result[1]=int(i)
    elif int(i)>result[2]:
        result[2]=int(i)
for i in result:
    print(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:
data = [int(input()) for i in range(10)]

datah = sorted(data, reverse = True)

print(*(datah[:1]))
print(*(datah[1:2]))
print(*(datah[2:3]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
W = []
i=0
for i in range(0,10):
    a= int(input())
    W.append(a)
    i += 1
j = sorted(W, reverse=True)[:3]
[print(i) for i in j]

Submission status: Accepted

Solution code:
list=[]
for I in range(10):
   h=int(input())
   list.append(h)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a.sort()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=[]
for i in range(10) :
    a.append(input())
j=0
while j<10 :
    k=0
    while k<9 :
        if int(a[k])<int(a[k+1]) :
            tmp=a[k]
            a[k]=a[k+1]
            a[k+1]=tmp
        k=k+1
    j=j+1
print(a[0])
print(a[1])
print(a[2])

Submission status: Accepted

Solution code:
mou1=mou2=mou3=0
for i in range(10):
    a=int(input())
    if a>mou1:
        mou3=mou2
        mou2=mou1
        mou1=a
    elif a>mou2:
        mou3=mou2
        mou2=a
    elif a>mou3:
        mou3=a
    else:
        pass
    
print(mou1)
print(mou2)
print(mou3)

Submission status: Accepted

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


a=sorted(a, reverse=True)

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()
print(h[9])
print(h[8])
print(h[7])

Submission status: Accepted

Solution code:
# coding: utf-8
# 49

T = [int(input()) for i in range(10)]

T.sort()

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

Submission status: Accepted

Solution code:
n=[int(input()) for i in range(10)]
b=sorted(n)
print(b[9])
print(b[8])
print(b[7])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#0001
l = []
for i in range(10):
    l.append(int(input()))
y = sorted(l,reverse=True)
print(y[0])
print(y[1])
print(y[2])

Submission status: Accepted

Solution code:
a=0
b=0
c=0

for i in range(10):
    x = int(input())
    if x > c:
        a = b
        b = c
        c = x

    elif x > b:
        a = b
        b = x
        
    elif x > a:
        a = x

print(c)
print(b)
print(a)

Submission status: Accepted

Solution code:

m = [int(input()) for i in range(10)]

list.sort(m)

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

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

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

Submission status: Accepted

Solution code:
i = 1
x = []
while i <= 10:
    n = int(input())
    x.append(n)
    i += 1
    
a = sorted(x, reverse=True)
print(a[0])
print(a[1])
print(a[2])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
max1=0; max2=0; max3=0
for i in range(10):
    x=int(input())
    if max1<x:
        max3=max2
        max2=max1
        max1=x
    elif max2<x:
        max3=max2
        max2=x
    elif max3<x:
        max3=x
print(max1)
print(max2)
print(max3)

Submission status: Accepted

Solution code:
x1=[]
for i in range(10):
    h=int(input())
    x1.append(h)
x=sorted(x1,reverse=True)
print(x[0])
print(x[1])
print(x[2])

Submission status: Accepted

Solution code:
a1=int(input())
a2=int(input())
a3=int(input())
a4=int(input())
a5=int(input())
a6=int(input())
a7=int(input())
a8=int(input())
a9=int(input())
a10=int(input())
s=[]
s=[a1,a2,a3,a4,a5,a6,a7,a8,a9,a10]
s.sort()
print(s[9])
print(s[8])
print(s[7])

Submission status: Accepted

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

for i in range(3):
    maximum = 0
    index = i
    for j in range(i, 10):
        if mountain_heights[j] > maximum:
            maximum = mountain_heights[j]
            index = j
    temp = mountain_heights[i]
    mountain_heights[i] = mountain_heights[index]
    mountain_heights[index] = temp
    print(maximum)

Submission status: Accepted

Solution code:
S = [int(input()) for i in range(10)]
S.sort(reverse=1)
print(*S[:3], sep='\n')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque

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

Meter_new = deque(sorted(Meter, reverse=True))

for i in range(3):
    print(Meter_new.popleft())

Submission status: Accepted

Solution code:
def main():
    import heapq
    h = [0]*10
    for i in range(10):
        h[i] = int(input()) * (-1)

    heapq.heapify(h)
    for _ in range(3):
        print(heapq.heappop(h) * (-1))
main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
M = []

for i in range(10) :
    M.append(int(input()))
    
Ms = sorted(M, reverse = True)

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

Submission status: Accepted

Solution code:
mountain_high = []

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

mountain_high.sort(reverse = True)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
ans = []

for i in range(10):
  a = int(input())
  ans.append(a)
ans = sorted(ans, reverse=True)
print(*ans[:3],sep='\n')

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

for i in range(9,6,-1):
    print(array[i])

Submission status: Accepted

Solution code:
mountainList = []

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

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

Submission status: Accepted

Solution code:
height = [int(input()) for _ in range(10)]
height = list(reversed(sorted(height)))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
heights = []

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

Submission status: Accepted

Solution code:
a = [list(map(int,input().split()))for i in range(10)]
a = sorted(a)[::-1]
for i in a[:3]:
    print(*i, sep='\n')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
f = int(input())
g = int(input())
h = int(input())
i = int(input())
j = int(input())

hights = [a,b,c,d,e,f,g,h,i,j]
hights.sort(reverse = True)
print(hights[0],hights[1],hights[2],sep="\n")

Submission status: Accepted

Solution code:
i = 0
input_null = 0
input_list = []

n = 10 #input個数
while i < n:
    input_list.append(int(input()))
    #print(input_list[i])
    i += 1
    
sort_input_list = sorted(input_list,reverse=True)

j = 0

while j < 3:
    print(sort_input_list[j])
    j += 1

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

lul.sort()
print(str(lul[9]))
print(str(lul[8]))
print(str(lul[7]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = 0
b = 0
c = 0

for i in range(10):
  x=int(input())
  if x>=a:
    c = b
    b = a
    a = x
  elif x>=b:
    c = b
    b = x
  elif x >=c:
    c = x

print(a)
print(b)
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
height_list = []

for _ in range(0, 10):
    height_list.append(int(input()))

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