#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
typedef long long ll;
using namespace std;
int main() {
    int n, k;
    cin >> n >> k;
    vector<int> nums(n);
    for (int &i: nums) cin >> i;
    vector<int> diff;
    for (int i = 1; i<n; ++i) {
        int x = nums[i] - nums[i - 1] - 1;
        diff.push_back(x);
    }
    sort(diff.begin(), diff.end());
    int ans = n;
    for (int i = 0; i<n - k; ++i) {
        ans += diff[i];
    }
    cout << ans << '\n';
    return 0;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |