[백준] 5576번 콘테스트 문제! (bronze 2

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Main{
	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
		int[] w=new int[10];
		int[] k=new int[10];
		for(int i=0; i<10; i++) {
			w[i]=Integer.parseInt(br.readLine());
		}
		for(int i=0; i<10; i++) {
			k[i]=Integer.parseInt(br.readLine());
		}
		w=insertionSort(w,w.length);
		k=insertionSort(k,k.length);
		int sumW=w[9]+w[8]+w[7];
		int sumK=k[9]+k[8]+k[7];
		bw.write(sumW+" "+sumK);
		bw.flush();
		
	}
	
	
	
	//삽입정렬을 이용하여 풀어보았다.
	public static int[] insertionSort(int[] num, int length) {
		int temp;
		for(int i=1; i<length; i++) {
			for(int j=i; j>0; j--) {
				if(num[j-1]>num[j]) {
					temp=num[j-1];
					num[j-1]=num[j];
					num[j]=temp;
				}
				
			}
		}
		return num;
	}
}