백준 문제 풀이 25305 | JAVA

25305번: 커트라인 (acmicpc.net)

 

 

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

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] firstLine = br.readLine().split(" ");
        int n = Integer.parseInt(firstLine[0]);
        int k = Integer.parseInt(firstLine[1]);

        String[] scoresStr = br.readLine().split(" ");
        int[] x = new int[n];
        for(int i =0; i <n; i++)
            x[i] = Integer.parseInt(scoresStr[i]);
        sort(x, n);
        System.out.println(x[k-1]);
    }
    public static void sort(int[] x, int n){
        int high;
        for(int i = 0; i < n - 1; i++){
            high = i;
            for(int j = i + 1; j < n; j++){
                if(x[j] > x[high]) high = j;
            }
            swap(x, i, high);
        }
    }

    public static void swap(int[] x, int i, int least) {
        int temp = x[i];
        x[i] = x[least];
        x[least] = temp;
    }
}