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

import java.util.Scanner;

class Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
	int[]height=new int[10];
	for(int i=0;i<10;i++){
	    height[i]=sc.nextInt();
	}
	int max=0;

	int[]top={-1,-1,-1};

	for(int i=0;i<3;i++){
	    for(int j=0;j<10;j++){
		if(j!=top[0]&&j!=top[1]&&j!=top[2]){
		    if(max<height[j]){
			top[i]=j;
			max=height[j];
		    }
		}
	    }
	max=0;	   
	}
	for(int i=0;i<3;i++) {
	    System.out.println(height[top[i]]);
	}
    }
}