Submission #1155635

#TimeUsernameProblemLanguageResultExecution timeMemory
1155635ryanStove (JOI18_stove)Java
0 / 100
58 ms11344 KiB
import java.util.*;
class Main {
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int k = scan.nextInt();
        Long arr[] = new Long[n];
        for(int i = 0; i < n; i++){
            arr[i] = scan.nextLong();
        }
        Long dif[] = new Long[n-1];
        for(int i = 0; i < n-1; i++){
            dif[i] = arr[i+1] - arr[i]-1;
        }
        Arrays.sort(dif, Collections.reverseOrder());
        Long total = arr[n-1] - arr[0]+1;
        for(int i = 0; i<=k-1; i++){
            total -= dif[i];
        }
        System.out.println(total);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...