# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
93506 |
2019-01-09T05:54:12 Z |
almasalmas |
Stove (JOI18_stove) |
C++17 |
|
21 ms |
2936 KB |
#include <bits/stdc++.h>
using namespace std;
long long a[500001];
long long b[500001];
int main () {
ios_base::sync_with_stdio (0);
cin.tie (0), cout.tie (0);
long long n, k;
cin >> n >> k;
for (int i = 1;i <= n;i ++) {
cin >> a[i];
}
for (int i = 1;i < n;i ++) {
b[i] = a[i + 1] - a[i] - 1;
}
sort (b + 1, b + n);
long long ans = 0;
for (int i = 1;i <= n - k;i ++) ans += b[i];
cout << ans + n;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
388 KB |
Output is correct |
2 |
Correct |
2 ms |
380 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
388 KB |
Output is correct |
2 |
Correct |
2 ms |
380 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
504 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
504 KB |
Output is correct |
15 |
Correct |
2 ms |
380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
388 KB |
Output is correct |
2 |
Correct |
2 ms |
380 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
504 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
504 KB |
Output is correct |
15 |
Correct |
2 ms |
380 KB |
Output is correct |
16 |
Correct |
21 ms |
2936 KB |
Output is correct |
17 |
Correct |
21 ms |
2936 KB |
Output is correct |
18 |
Correct |
20 ms |
2808 KB |
Output is correct |
19 |
Correct |
20 ms |
2808 KB |
Output is correct |
20 |
Correct |
20 ms |
2936 KB |
Output is correct |
21 |
Correct |
20 ms |
2808 KB |
Output is correct |
22 |
Correct |
20 ms |
2936 KB |
Output is correct |
23 |
Correct |
20 ms |
2808 KB |
Output is correct |
24 |
Correct |
20 ms |
2936 KB |
Output is correct |