摆玩具

 

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k;

    cin >> n >> k;

    int h[n];
    int diff[n]; //两数之差数组

    for (int i = 1; i <= n; i++) {
        cin >> h[i];
    }
    
    for (int i = 1; i < n; i++) {
        diff[i] = h[i + 1] - h[i];
    }

    sort(diff + 1, diff + n); //差值从小到大排序

    int ans = 0;

    for (int i = 1; i < n - k + 1; i++) { //如果是从大到小顺序排，前 k-1 项差去除，也即只要当前顺序的前n-k项
        ans += diff[i];
    }
    cout << ans << "\n";

    return 0;
}