#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
multiset<long long> s;
int n, k, a[maxn + 1];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
a[0] = -1e9;
for (int i = 1; i <= n; ++i){
cin >> a[i];
s.insert(a[i] - a[i - 1]);
}
long long res = k;
n -= k;
while(n--){
res += *s.begin();
s.erase(s.begin());
}
cout << res;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |