#include<bits/stdc++.h>
using namespace std;
struct Compare{
    bool operator()(int a, int b) const {
        return a>b;
    };
};
priority_queue<int,vector<int>,Compare> pq;
int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n,k,i,a,b;
    cin>>n>>k;
    int ans=n;
    for(i=0;i<n;i++){
        if(i==0) cin>>a;
        else{
            cin>>b;
            pq.push(b-a-1);
            swap(a,b);
        }
    }
    for(i=0;i<n-k;i++){
        ans+=pq.top();
        pq.pop();
    }
    cout<<ans;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |