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

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {
	private final static int LIST_MAX = 10;
	private final static int INPUT_MIN = 0;
	private final static int INPUT_MAX = 10000;
	
	public static void main(String[]args){
		int Mt_list[];
		Mt_list = input();
		
		sort(Mt_list);
		
		show(Mt_list);
	}
	
	public static void show(int[] list){
		for(int i:list){
			System.out.println(i);
		}
	}
	
	public static int[] input(){
		Scanner stdIn = new Scanner(System.in);
		int list[] = new int[LIST_MAX];
		
		for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		}
		
		stdIn.close();
		return list;
	}
	
	public static boolean input_ck(int x){
		if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		}
		return false;
	}
	
	public static int[] sort(int[] list){
		for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		}
		return list;
	}
}