/// @author : Hoang Manh Linh
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
using i64 = long long;
#define eb emplace_back
#define all(a) a.begin(), a.end()
int TC;
int n, k;
i64 a[MAXN];
int main(int argc, char **argv) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
TC = 1;
while(TC--) {
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
vector<i64> res;
for(int i = 2; i <= n; i++)
res.eb(a[i] - a[i - 1] - 1);
sort(all(res));
reverse(all(res));
i64 ans = a[n];
for(int i = 0; i < k - 1; i++)
ans -= res[i];
cout << ans << "\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |