본문 바로가기
Problem Solving/Baekjoon

[백준] 30350 Dviratininkas - Greedy / Java

by graycode 2025. 8. 28.

 문제 링크

https://www.acmicpc.net/problem/30350

 

 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringBuilder sb = new StringBuilder();

        int n = read(), k = read();
        Pair[] arr = new Pair[n];
        for (int i = 0; i < n; ) arr[i] = new Pair(read(), ++i);
        Arrays.sort(arr);

        for (int i = 0; i < k; i++) sb.append(arr[i].b).append('\n');

        bw.write(sb.toString());
        bw.flush();
    }

    private static class Pair implements Comparable<Pair> {
        int a, b;

        Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }

        @Override
        public int compareTo(Pair o) {
            return o.a - this.a;
        }
    }

    private static int read() throws IOException {
        int c, n = System.in.read() & 15;
        while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);

        return n;
    }

}

댓글