#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n, k; cin >> n >> k;
int a[100005];
for(int i = 1 ; i <= n ; i++)cin >> a[i];
int ans = a[n] - a[1] + 1;
priority_queue <int> pq;
for(int i = 2 ; i <= n ; i++)pq.push(a[i] - (a[i - 1] + 1));
int t = k - 1;
while(t-- && pq.size()){
ans -= pq.top();
pq.pop();
}
cout << ans << endl;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |