2024.06.14 ( Java )

1. 센서 ( BaekJoon )

Greedy ( https://www.acmicpc.net/problem/2212 )

풀이 ->

package problem_solving.greedy;

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

public class BaekJoon_2212 {

	public static void main(String[] args) {
		Scanner sc=  new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int k = Integer.parseInt(sc.next());
		if( k >= n ) {
			System.out.println(0);
			return ; 
		}
		int [] arr = new int[n];
		for(int i = 0; i < n ;i++) {
			arr[i] = Integer.parseInt(sc.next());
		}
		
		Arrays.sort(arr);
		
		int [] indexArr = new int[n-1];
		int index = 0 ; 
		for(int i= 0 ; i < arr.length -1 ;i++) {
			indexArr[index++] = arr[i+1]-arr[i];
		}
		
		Arrays.sort(indexArr);
		int sum = 0 ; 
		for(int i= 0 ; i < n - k ; i++) {
			sum+=indexArr[i];
		}
		
		System.out.println(sum);
	}

}

백준 레벨 변동

• Gold 5 41% -> Gold 5 45%

풀이 유형

Greedy - 1문제