๐ป Coding Problems Solving/Greedy
[BOJ 2212] ์ผ์
Kim_dev
2023. 6. 5. 21:04
[BOJ 2212] ์ผ์
1. ๋ฌธ์ : https://www.acmicpc.net/problem/2212
2. ํ์ด
๊ทธ๋ฆฌ๋ํ๊ฒ ์ฐจ์ด๊ฐ ์ ๊ฒ๋๋ ๋ถ๋ถ ๋ํด์ฃผ๊ธฐ
3. ์ฝ๋
package baekjoon;
import java.util.*;
public class Main {
static int N,K;
static int cnt;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
N = sc.nextInt();
K = sc.nextInt();
List<Integer> arr = new ArrayList<>();
List<Integer> temp = new ArrayList<>();
int now;
for(int i=0; i<N; i++){
now = sc.nextInt();
if(arr.contains(now)){
continue;
}else{
arr.add(now);
}
}
Collections.sort(arr);
int len = arr.size();
int a;
for(int i=1; i<len; i++){
a = arr.get(i) - arr.get(i-1);
temp.add(a);
}
Collections.sort(temp);
for(int i=0; i<len-K; i++){
cnt += temp.get(i);
}
System.out.println(cnt);
}
}