GiantStepDEV
article thumbnail

๋ฌธ์ œ

2022 ์—ฐ์„ธ๋Œ€ํ•™๊ต ๋ฏธ๋ž˜์บ ํผ์Šค แ„‰แ…ณแ†ฏแ„€แ…ตแ„…แ…ฉแ„‹แ…ฎแ†ซ แ„แ…ฉแ„ƒแ…ตแ†ผแ„‰แ…ขแ†ผแ„’แ…ชแ†ฏ์— N๋ช…์˜ ํ•™์ƒ๋“ค์ด ์‘์‹œํ–ˆ๋‹ค.

์ด๋“ค ์ค‘ ์ ์ˆ˜๊ฐ€ ๊ฐ€์žฅ ๋†’์€ K๋ช…์€ ์ƒ์„ ๋ฐ›์„ ๊ฒƒ์ด๋‹ค. ์ด ๋•Œ, ์ƒ์„ ๋ฐ›๋Š” ์ปคํŠธ๋ผ์ธ์ด ๋ช‡ ์ ์ธ์ง€ ๊ตฌํ•˜๋ผ.

์ปคํŠธ๋ผ์ธ์ด๋ž€ ์ƒ์„ ๋ฐ›๋Š” ์‚ฌ๋žŒ๋“ค ์ค‘ ์ ์ˆ˜๊ฐ€ ๊ฐ€์žฅ ๊ฐ€์žฅ ๋‚ฎ์€ ์‚ฌ๋žŒ์˜ ์ ์ˆ˜๋ฅผ ๋งํ•œ๋‹ค.

์ž…๋ ฅ

์ฒซ์งธ ์ค„์—๋Š” ์‘์‹œ์ž์˜ ์ˆ˜ N๊ณผ ์ƒ์„ ๋ฐ›๋Š” ์‚ฌ๋žŒ์˜ ์ˆ˜ K๊ฐ€ ๊ณต๋ฐฑ์„ ์‚ฌ์ด์— ๋‘๊ณ  ์ฃผ์–ด์ง„๋‹ค.

๋‘˜์งธ ์ค„์—๋Š” ๊ฐ ํ•™์ƒ์˜ ์ ์ˆ˜ X๊ฐ€ ๊ณต๋ฐฑ์„ ์‚ฌ์ด์— ๋‘๊ณ  ์ฃผ์–ด์ง„๋‹ค.

์ถœ๋ ฅ

์ƒ์„ ๋ฐ›๋Š” ์ปคํŠธ๋ผ์ธ์„ ์ถœ๋ ฅํ•˜๋ผ.


import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        Integer[] arr = new Integer[n];
        for(int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        System.out.println(arr[n - k]);
    }
}

profile

GiantStepDEV

@kongmi

ํฌ์ŠคํŒ…์ด ์ข‹์•˜๋‹ค๋ฉด "์ข‹์•„์š”โค๏ธ" ๋˜๋Š” "๊ตฌ๋…๐Ÿ‘๐Ÿป" ํ•ด์ฃผ์„ธ์š”!