문제 풀이 및 개발 공간

[백준] 9076번 점수 집계 문제! (bronze 2 본문

백준공부/java

[백준] 9076번 점수 집계 문제! (bronze 2

gomduri43 2022. 8. 18. 08:48

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

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));
		StringTokenizer st;
		int t=Integer.parseInt(br.readLine());
		int[] num=new int[5];
		for(int i=0; i<t; i++) {
			st=new StringTokenizer(br.readLine());
			for(int j=0; j<5; j++) {
				num[j]=Integer.parseInt(st.nextToken());
			}
			num=insertionSort(num,num.length);
			if((num[3]-num[1])>=4) {
				bw.write("KIN"+"\n");
			}
			else {
				bw.write(num[1]+num[2]+num[3]+"\n");
			}
		}
		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;
	}
	

}