//*--- ©ZeroCoolCorp --- *//
#include <bits/stdc++.h>
#define endl '\n'
#define debug(v) cerr<<v<<endl;
#define ll long long
#define ld long double
using namespace std;
const int mxn = 2e5 + 5;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9;
void solve(int T){
priority_queue<int,vector<int>,greater<int>>q;
int n,k;
cin>>n>>k;
int a[n];
for(int i = 0;i < n;i++){
cin>>a[i];
if(i > 0)q.push(a[i] - a[i - 1]);
}
ll ans = n;
k = n - k;
while(k > 0){
ans += q.top();
ans--;
q.pop();
k--;
}
cout<<ans<<endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++)solve(i);
}
//*--- This is code from the best programer ---*//
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
312 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
316 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
312 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
316 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
328 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
312 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
316 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
328 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
| 16 |
Correct |
25 ms |
2240 KB |
Output is correct |
| 17 |
Correct |
24 ms |
2124 KB |
Output is correct |
| 18 |
Correct |
24 ms |
2136 KB |
Output is correct |
| 19 |
Correct |
23 ms |
2120 KB |
Output is correct |
| 20 |
Correct |
18 ms |
2244 KB |
Output is correct |
| 21 |
Correct |
13 ms |
2108 KB |
Output is correct |
| 22 |
Correct |
12 ms |
2144 KB |
Output is correct |
| 23 |
Correct |
12 ms |
2136 KB |
Output is correct |
| 24 |
Correct |
13 ms |
2136 KB |
Output is correct |
