백준 2212 java

magicdrill·2024년 10월 21일
0

백준 문제풀이

목록 보기
468/655

백준 2212 java

import java.awt.*;
import java.util.*;

public class bj2212 {
    static Scanner scanner = new Scanner(System.in);
    static int N, K;
    static int[] data;

    public static void main(String[] args) {
        inputData();
        System.out.println(findAnswer());

        scanner.close();
    }

    public static void inputData()
    {
        System.out.println("inputData()");
        int i, temp;

        N = scanner.nextInt();
        K = scanner.nextInt();
        data = new int[N];
        for(i = 0; i < N; i++)
        {
            temp = scanner.nextInt();
            data[i] = temp;
        }

        System.out.println("입력결과");
        for(int A : data)
        {
            System.out.print(A + " ");
        }
        System.out.println();
    }

    public static int findAnswer()
    {
        System.out.println("findAnswer()");
        int answer = 0;
        int i;
        Integer [] distance = new Integer[data.length - 1];

        //입력받은 자료 정렬
        Arrays.sort(data);

        System.out.println("data 정렬결과");
        for(int A : data)
        {
            System.out.print(A + " ");
        }
        System.out.println();

        for(i = 0; i < distance.length; i++)
        {
            distance[i] = data[i+1] - data[i];
        }
        Arrays.sort(distance, Collections.reverseOrder());//정렬

        System.out.println("distance 정렬결과");
        for(int A : distance)
        {
            System.out.print(A + " ");
        }
        System.out.println();

        for(i = K - 1; i < distance.length; i++)
        {
            System.out.println("distance = "+distance[i]);
            answer += distance[i];
        }
        System.out.println("answer = " + answer);

        return answer;
    }
}

0개의 댓글